-
hibernate, development and entry and explain in detail, configuration files of v...
hibernate,开发与入门并详细解释,配置文件中的各个字段.-hibernate, development and entry and explain in detail, configuration files of various fields.
- 2023-05-03 14:30:03下载
- 积分:1
-
本文利用人耳的感知特性,提出了加权倒谱系数,并建立 了相应的分析算法。...
本文利用人耳的感知特性,提出了加权倒谱系数,并建立 了相应的分析算法。-In this paper, characteristics of the human ears perception presented a weighted cepstral coefficients, and the establishment of a corresponding analysis algorithms.
- 2022-04-25 05:36:24下载
- 积分:1
-
institutions of higher learning computer science and technology "15" p...
高等院校计算机科学与技术“十五”规划教材基于数据仓库的数据挖掘技术康晓东 主编黎小沛 饶友玲 张建平 副主编
使用阿帕比apabi浏览器阅读-institutions of higher learning computer science and technology "15" planning materials based on the data warehouse data mining technology Guangming Xiaopeiraoyou editor-in-chief Li Ling Zhang Jianping, deputy editor of the use of Apache apabi browser than reading
- 2023-02-26 23:45:04下载
- 积分:1
-
文件为uc/os电子书籍,该书通俗易懂,对初学者有很大的帮助
文件为uc/os电子书籍,该书通俗易懂,对初学者有很大的帮助-Document for the uc/os e-books, the book user-friendly, and very helpful for beginners
- 2022-01-25 14:56:42下载
- 积分:1
-
Java on the machine for two questions, learning Java can be to test the two
为二级java 上机试题,学习Java要考二级的可以-Java on the machine for two questions, learning Java can be to test the two
- 2022-02-25 06:35:50下载
- 积分:1
-
本书讲述了各种管理移动业务的先进技术及移动业务的商业应用。...
本书讲述了各种管理移动业务的先进技术及移动业务的商业应用。-book on the various operational management of advanced mobile technologies and mobile business applications.
- 2023-08-02 15:10:04下载
- 积分:1
-
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价...
背包问题动态规划算法JAVA
给定n种物品和一背包。物品i的重量是wi,其价值为vi,背包的容量为c。问应如何选择装入背包中的物品,使得装入背包中物品的总价值最大?
在选择装入背包的物品时,对每种物品i只有两种选择,即装入背包或不装入背包。不能将物品i装入背包多次,也不能只装入部分的物品i。因此,该问题称为0-1背包问题。-Knapsack problem dynamic programming algorithm for a given n species JAVA goods and one backpack. Item i is the weight of wi, the value for vi, knapsack capacity c. Question should be how to choose the items into the backpack, the backpack into the total value of the largest items? In the selection of the items into the backpack, for each of the items i have only two choices, that is loaded or not loaded backpack backpack. Items should not be many times i load backpack can not only part of the goods loaded i. Therefore, the problem known as the 0-1 knapsack problem.
- 2023-04-22 23:20:03下载
- 积分:1
-
此文件详细地介绍c、c++函数集合,帮你深入理解vc
此文件详细地介绍c、c++函数集合,帮你深入理解vc-This document is a detailed introduction c, c++ Function set, to help you understand the depth vc
- 2022-01-26 02:53:43下载
- 积分:1
-
谱减法是一种比较简单的语音降噪的方法,在语音信号具有较高的信噪比的情况下具有良好的降噪功能。...
谱减法是一种比较简单的语音降噪的方法,在语音信号具有较高的信噪比的情况下具有良好的降噪功能。-Spectral subtraction is a relatively simple method of noise reduction voice in the voice signal with higher signal to noise ratio case has a good noise reduction function.
- 2023-04-13 13:20:03下载
- 积分:1
-
perfect delphi programming and useful! For beginners or those who have in
delphi完美编程,很有用!对初学者或深入者都有用的哦-perfect delphi programming and useful! For beginners or those who have in-depth with the oh
- 2023-03-25 18:00:04下载
- 积分:1