This complete matlab for neural network
標簽： complete network matlab neural
上傳時間： 2016-11-17
上傳用戶：wsf950131
These files contain all of the code listings in C: The Complete Reference, 4th Edition The source code is organized into files by chapter. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested.
標簽： The Reference Complete listings
上傳時間： 2016-11-23
上傳用戶：nanshan
GCCThe Complete Reference
上傳時間： 2013-12-26
上傳用戶：清風冷雨
NP-hard問題分析 NP-hard問題分析
上傳時間： 2016-12-15
上傳用戶：yy541071797
Family Tree This a geneology program for entering your family tree. It s a complete working app but has no reports within it. You can add pictures and name the individuals in the pictures using a really cool frame and name technique. You can also add census information and lots more.
標簽： geneology entering complete program
上傳時間： 2016-12-16
上傳用戶：www240697738
在《C++ Templates: The Complete Guide》一書中（以下簡稱書），提出了模板元編程最早的實際應用之一：在數值運算中進行解循環優化。 而本文的標題是噱頭！本文的真正目的是指出這種優化措施在增加復雜性的同時，并不一定能明顯改善效率。應當謹慎使用該技術——默認不使用該技術，在點積計算確實是效率瓶頸時考慮采用該技術，并認真測試該技術是否真能提高效率。
標簽： Templates Complete Guide The
上傳時間： 2017-01-05
上傳用戶：hxy200501
JavaScript 2.0: The Complete Reference, Second Edition
標簽： JavaScript Reference Complete Edition
上傳時間： 2014-01-06
上傳用戶：彭玖華
Eclipse+Web開發從入門到精通 These files contain all of the code listings in Java: The Complete Reference, J2SE 5 Edition The source code is organized into files by chapter. For example, the file Chap7.code contains the programs shown in Chapter 7. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested.
標簽： Complete Referenc listings Eclipse
上傳時間： 2017-01-20
上傳用戶：as275944189
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
標簽： combinatorial assignment problem arises
上傳時間： 2014-01-19
上傳用戶：BIBI
These files contain all of the code listings in Java 2: The Complete Reference The source code is organized into files by chapter. Within each chapter file, the listings are stored in the same order as they appear in the book. Simply edit the appropriate file to extract the listing in which you are interested. The code for Scrabblet is in its own ZIP file, called CHAP32.ZIP.
標簽： The Reference Complete listings
上傳時間： 2013-11-29
上傳用戶：3到15
