搜索资源列表
zhengfu
- 征服模似器Ｃ语言代码，下载的-conquer for it with C language code and download the hurry!
ajax-luncene
- 此源码为征服ajax+Lucene构建搜索引擎源码,包括很多事例,大家可以借鉴。-to conquer this source Construction ajax Lucene search engine source code, including many examples, we can learn from.
Bigintmutiply
- 大整数乘法的分治法源码，在JDK1.51中运行-large integer multiplication of the divide-and-conquer method source code, to run in JDK1.51
AJAXkaifa
- 征服ajax＋lucene书籍各章节源代码ajax部分-conquer ajax + lucene book chapters part of the source code ajax
zhengfuLucene
- 征服ajax＋lucene书籍各章节源代码lucene部分-conquer ajax + lucene book chapters part of the source code lucene
打天下php+mysql招聘求职源代码
- 打天下php+mysql招聘求职源代码-conquer the world php mysql job recruitment source code
ConquerServerSource
- 征服服务端源代码 什么版本自己去研究,不过可以肯定是2.0以上版本的外国源代码-Conquest of what version of server-side source code for their own to study, but you can certainly be 2.0 or above versions of the foreign source code
msdar
- Conquer online Source Code Patch 5165
GeneratingFPGA-AcceleratedDFTLibraries
- 关于DFT的文章，应用FPGA实现傅立叶变换。-Abstract—We present a domain-specific approach to generate high-performance hardware-software partitioned implementations of the discrete Fourier transform (DFT). The partitioning strategy is a heuristic based on the DFT
xunhuansaiqxf
- 算法课程设计 分治法解决循环赛日程表 源代码+word报告+答辩PPT-Curriculum design of divide and conquer algorithm to solve a round robin schedule report+ source code+ word reply PPT
ajax-Web2.0-code
- 《征服ajax Web2.0开发技术详解》光盘源码-《Detailed development of technology to conquer ajax Web2.0》 CD source
code
- 3道分治算法题目以及解析。题目为图片，对应题目名有对应程序，在C/C++语言编译环境中测试通过。-3 topics as well as parsing of divide-and-conquer algorithm. Subject to the pictures corresponding topic name corresponding to the program, the test passed in the C/C++ language compiler environment.
Impulses-Source-[conquer]
- [征服纵马江湖老端] Impulse s Source [支持百人]源代码。很稀有的哦！需要的下载-[To conquer the old horse itinerant end] Impulse' s Source [support the hundred] source code. Oh, very rare! Need to download
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Uses backtracking method to solve the problems of the typical algorithms: the knight tour problem, n queen problem, 0-1 knapsack problem. Recursion and divide and conq
code
- 使用回溯法解决的典型问题的算法：骑士巡游问题，n皇后问题，0-1背包问题。 使用递归与分治策略解决的几个问题的算法：Hanoi塔问题和二分搜索技术。-Use backtracking to solve the typical problems of algorithms: knight tour problem, n queens problem 0-1 knapsack problem. Use recursion and divide and conquer strategy to so
chessboard-coverage-of-c-code
- 利用分治策略对棋盘覆盖问题进行求解，用c语言来实现。-Using divide and conquer strategy chessboard coverage of c code
divide-and-conquer-algorithm
- 详细讲解了算法学习中的分治算法的原理，并附有详细的例题讲解和伪码-Explained in detail the algorithm of learning the principle of divide and conquer algorithm, with a detailed example to explain and pseudo-code
ExodusBinaries
- 4267 version conquer with cq_action cq_task code
LordsRoad Fixed By Amjad V 2
- 征服新版模拟器源代码，V2版,能正常编译(Conquer the new version of the simulator source code, V2)
Conquer(mysql)
- 征服5506版，带数据库，正常编译，能开区。(Conquer the 5506 edition, with database, normal compilation, can open area.)