b+tree树的java实现。 是一个框架， 可以往里加新的东西， 实现复杂的功能
上传时间： 2015-08-20
上传用户：84425894
高级树,介绍各种高级树的原理,如B+树,策略树,等
上传时间： 2014-01-01
上传用户：牛布牛
本程序使用于爱思51-B型高级用户板功能测试及演示,是用asm写的，有要的朋友可以下下，
上传时间： 2015-08-26
上传用户：lmeeworm
本文开发了一套基于J2EE技术的新兵思想评估系统。该系统基于多层B／S软件架构，提高了系统的稳定性、灵活性及安全性；通过使用UML的系统分析，MVC、DAO等设计模式及面向对象（ＶＣ＋＋）的设计和开发，采用Spring、Hibernate、WebWork等框架技术，提高了开发的效率，为相关系统的设计开发探索了一条新思路。
上传时间： 2013-12-24
上传用户：gxf2016
高斯亚当消去法 GAUSSJ(A[],N,B[])用这个子过程实现高斯亚当消去法
上传时间： 2015-08-29
上传用户：541657925
生产排程计划的一份源码.JAVA.B/S结构的。希望对一部分人有帮助
上传时间： 2015-08-30
上传用户：小草123
BackProp算法：经典的B-P算法.
上传时间： 2014-11-22
上传用户：xc216
by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) the text of Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon
标签： L. published Schwartz Edition
上传时间： 2014-11-29
上传用户：kr770906
by Randal L. Schwartz and Tom Phoenix ISBN 0-596-00132-0 Third Edition, published July 2001. (See the catalog page for this book.) Learning Perl, 3rd Edition. Table of Contents Copyright Page Preface Chapter 1: Introduction Chapter 2: Scalar Data Chapter 3: Lists and Arrays Chapter 4: Subroutines Chapter 5: Hashes Chapter 6: I/O Basics Chapter 7: Concepts of Regular Expressions Chapter 8: More About Regular Expressions Chapter 9: Using Regular Expressions Chapter 10: More Control Structures Chapter 11: Filehandles and File Tests Chapter 12: Directory Operations Chapter 13: Manipulating Files and Directories Chapter 14: Process Management Chapter 15: Strings and Sorting Chapter 16: Simple Databases Chapter 17: Some Advanced Perl Techniques Appendix A: Exercise Answers Appendix B: Beyond the Llama Index Colophon
标签： L. published Schwartz Edition
上传时间： 2015-09-03
上传用户：lifangyuan12
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
