高級(jí)樹,介紹各種高級(jí)樹的原理,如B+樹,策略樹,等
上傳時(shí)間： 2014-01-01
上傳用戶：牛布牛
本程序使用于愛思51-B型高級(jí)用戶板功能測(cè)試及演示,是用asm寫的，有要的朋友可以下下，
上傳時(shí)間： 2015-08-26
上傳用戶：lmeeworm
本文開發(fā)了一套基于J2EE技術(shù)的新兵思想評(píng)估系統(tǒng)。該系統(tǒng)基于多層B／S軟件架構(gòu)，提高了系統(tǒng)的穩(wěn)定性、靈活性及安全性；通過使用UML的系統(tǒng)分析，MVC、DAO等設(shè)計(jì)模式及面向?qū)ο螅ǎ郑茫┑脑O(shè)計(jì)和開發(fā)，采用Spring、Hibernate、WebWork等框架技術(shù)，提高了開發(fā)的效率，為相關(guān)系統(tǒng)的設(shè)計(jì)開發(fā)探索了一條新思路。
標(biāo)簽： J2EE 評(píng)估系統(tǒng) 多層
上傳時(shí)間： 2013-12-24
上傳用戶：gxf2016
Lamb problem: The analytical solution of vertical point source. This is very important for synthetic modeling
標(biāo)簽： analytical important synthetic solution
上傳時(shí)間： 2013-12-25
上傳用戶：hongmo
高斯亞當(dāng)消去法 GAUSSJ(A[],N,B[])用這個(gè)子過程實(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
From the Publisher Focus on 2D in Direct3D? teaches you all of the tools and tips you ll need to dive right in and begin creating your own games. If you have some knowledge of C or C++ and have been searching for a guide that will take your 2D programming into the third dimension, then search no more! In this book you ll learn the skills you ll need to move from the 2D API to Direct3D. Written from the point of view of a 2D programmer, Focus on 2D in Direct3D presents the fundamentals of the Direct3D API in an easy-to-use-and-understand format. Get ready to jump into the world of Direct3D!
標(biāo)簽： the Publisher you teaches
上傳時(shí)間： 2015-09-01
上傳用戶：ve3344
BackProp算法：經(jīng)典的B-P算法.
上傳時(shí)間： 2014-11-22
上傳用戶：xc216
this file is even FFT, max point is 8192,this file "fft4g.c" is computer this file "how_to_use_fft.c" is call function "fft4g.c"
標(biāo)簽： this file how_to_use_fft computer
上傳時(shí)間： 2014-01-14
上傳用戶：maizezhen
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
