b+tree樹的java實(shí)現(xiàn)。 是一個(gè)框架， 可以往里加新的東西， 實(shí)現(xiàn)復(fù)雜的功能
上傳時(shí)間： 2015-08-20
上傳用戶：84425894
/* * EULER S ALGORITHM 5.1 * * TO APPROXIMATE THE SOLUTION OF THE INITIAL VALUE PROBLEM: * Y = F(T,Y), A<=T<=B, Y(A) = ALPHA, * AT N+1 EQUALLY SPACED POINTS IN THE INTERVAL [A,B]. * * INPUT: ENDPOINTS A,B INITIAL CONDITION ALPHA INTEGER N. * * OUTPUT: APPROXIMATION W TO Y AT THE (N+1) VALUES OF T. */
標(biāo)簽： APPROXIMATE ALGORITHM THE SOLUTION
上傳時(shí)間： 2015-08-20
上傳用戶：zhangliming420
This section contains a brief introduction to the C language. It is intended as a tutorial on the language, and aims at getting a reader new to C started as quickly as possible. It is certainly not intended as a substitute for any of the numerous textbooks on C. 2. write a recursive function FIB (n) to find out the nth element in theFibanocci sequence number which is 1,1,2,3,5,8,13,21,34,55,…3. write the prefix and postfix form of the following infix expressiona + b – c / d + e * f – g * h / i ^ j4. write a function to count the number of nodes in a binary tr
標(biāo)簽： introduction the contains intended
上傳時(shí)間： 2013-12-23
上傳用戶：liansi
高級(jí)樹,介紹各種高級(jí)樹的原理,如B+樹,策略樹,等
上傳時(shí)間： 2014-01-01
上傳用戶：牛布牛
本程序使用于愛(ài)思51-B型高級(jí)用戶板功能測(cè)試及演示,是用asm寫的，有要的朋友可以下下，
上傳時(shí)間： 2015-08-26
上傳用戶：lmeeworm
本文開(kāi)發(fā)了一套基于J2EE技術(shù)的新兵思想評(píng)估系統(tǒng)。該系統(tǒng)基于多層B／S軟件架構(gòu)，提高了系統(tǒng)的穩(wěn)定性、靈活性及安全性；通過(guò)使用UML的系統(tǒng)分析，MVC、DAO等設(shè)計(jì)模式及面向?qū)ο螅ǎ郑茫┑脑O(shè)計(jì)和開(kāi)發(fā)，采用Spring、Hibernate、WebWork等框架技術(shù)，提高了開(kāi)發(fā)的效率，為相關(guān)系統(tǒng)的設(shè)計(jì)開(kāi)發(fā)探索了一條新思路。
標(biāo)簽： J2EE 評(píng)估系統(tǒng) 多層
上傳時(shí)間： 2013-12-24
上傳用戶：gxf2016
高斯亞當(dāng)消去法 GAUSSJ(A[],N,B[])用這個(gè)子過(guò)程實(shí)現(xiàn)高斯亞當(dāng)消去法
上傳時(shí)間： 2015-08-29
上傳用戶：541657925
生產(chǎn)排程計(jì)劃的一份源碼.JAVA.B/S結(jié)構(gòu)的。希望對(duì)一部分人有幫助
上傳時(shí)間： 2015-08-30
上傳用戶：小草123
BackProp算法：經(jīng)典的B-P算法.
上傳時(shí)間： 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.
標(biāo)簽： Implemented following compile command
上傳時(shí)間： 2014-01-01
上傳用戶：lhc9102
蟲蟲下載站版權(quán)所有 京ICP備2021023401號(hào)-1
