b+tree樹的java實現。 是一個框架， 可以往里加新的東西， 實現復雜的功能
上傳時間： 2015-08-20
上傳用戶：84425894
高級樹,介紹各種高級樹的原理,如B+樹,策略樹,等
上傳時間： 2014-01-01
上傳用戶：牛布牛
本程序使用于愛思51-B型高級用戶板功能測試及演示,是用asm寫的，有要的朋友可以下下，
上傳時間： 2015-08-26
上傳用戶：lmeeworm
MULTIDIMENSIONAL SCALING in matlab by Mark Steyvers 1999 ％needs optimization toolbox ％Modified by Bruce Land ％--Data via globals to anaylsis programs ％--3D plotting with color coded groups ％--Mapping of MDS space to spike train temporal profiles as described in ％Aronov, et.al. "Neural coding of spatial phase in V1 of the Macaque" in ％press J. Neurophysiology
標簽： MULTIDIMENSIONAL optimization Modified Steyvers
上傳時間： 2015-08-26
上傳用戶：kytqcool
本文開發了一套基于J2EE技術的新兵思想評估系統。該系統基于多層B／S軟件架構，提高了系統的穩定性、靈活性及安全性；通過使用UML的系統分析，MVC、DAO等設計模式及面向對象（ＶＣ＋＋）的設計和開發，采用Spring、Hibernate、WebWork等框架技術，提高了開發的效率，為相關系統的設計開發探索了一條新思路。
上傳時間： 2013-12-24
上傳用戶：gxf2016
This project attempts to implement a Database using B+Tree. The project has developed a DATABASE SYSTEM with lesser memory consumption. Its API includes simple SQL Statements and the output is displayed on the screen. Certain applications for which several features of existing databases like concurrency control, transaction management, security features are not enabled. B+Trees can be used as an index for factor access to the data. Help facility is provided to know the syntax of SQL Statements.
標簽： project implement developed Database
上傳時間： 2013-12-25
上傳用戶：semi1981
高斯亞當消去法 GAUSSJ(A[],N,B[])用這個子過程實現高斯亞當消去法
上傳時間： 2015-08-29
上傳用戶：541657925
生產排程計劃的一份源碼.JAVA.B/S結構的。希望對一部分人有幫助
上傳時間： 2015-08-30
上傳用戶：小草123
BackProp算法：經典的B-P算法.
上傳時間： 2014-11-22
上傳用戶：xc216
Implemented BFS, DFS and A* To compile this project, use the following command: g++ -o search main.cpp Then you can run it: ./search The input is loaded from a input file in.txt Here is the format of the input file: The first line of the input file shoud contain two chars indicate the source and destination city for breadth first and depth first algorithm. The second line of input file shoud be an integer m indicate the number of connections for the map. Following m lines describe the map, each line represents to one connection in this form: dist city1 city2, which means there is a connection between city1 and city2 with the distance dist. The following input are for A* The following line contains two chars indicate the source and destination city for A* algorithm. Then there is an integer h indicate the number of heuristic. The following h lines is in the form: city dist which means the straight-line distance from the city to B is dist.
標簽： Implemented following compile command
上傳時間： 2014-01-01
上傳用戶：lhc9102
