搜索资源列表
长
- 算法求值，是一个需要大家仔细思考得出的。是算法求值的算法，希望你们要努力思考-algorithm evaluates is a need for everyone to ponder are. Yes algorithm evaluates the algorithm that you should think hard about
宁疲
- 算法求值，是一个需要大家仔细思考得出的。是算法求值的算法，希望你们要努力思考-algorithm evaluates is a need for everyone to ponder are. Yes algorithm evaluates the algorithm that you should think hard about
xcwen
- 我一般用于制作和整理（文件搜索方式）编程技术文档和各类源代码, 可以如编程工具一样分色显示程序(C++, Delphi , java, Vb, SQL ……)(用算法实现), 主要用于查找相应的类和函数的应用。 同样可以用它来制作电子书籍。（制作出《诸子百家》） 考虑到兼容问题: 在发布时删除了皮肤组件.所以运行出来的效果不美观. 平台: delphi7 本软件为开源软件. 所有人都可以使用其源码.请注明出处就OK了 有任何问题,都可以向我发送Email.
pdf
- 快速图象倾斜检测和校正算法，速度快，准确率高，看上去，是个不错的算法。-Fast image tilt detection and correction algorithm speed, high accuracy rate, it seemed, be a good algorithm.
Rapto-Codes
- Raptor Codes 是一种新的纠错编码方式，这里是一篇关于该算法的国外的文章，格式为pdf。-Raptor Codes is a new error-correcting coding, this is an article on the algorithm abroad articles, format pdf.
Raptor-Bangalore
- Raptor Codes 是一种新的纠错编码方式，这里是一篇关于该算法的国外的文章，格式为pdf。-Raptor Codes is a new error-correcting coding, this is an article on the algorithm abroad articles, format pdf.
Raptor-Scheme
- Raptor Codes 是一种新的纠错编码方式，这里是一篇关于该算法的国外的文章，格式为pdf。-Raptor Codes is a new error-correcting coding, this is an article on the algorithm abroad articles, format pdf.
ProcScheduling
- 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对N（N不小于5）个进程进行调度。 “最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 (1). 静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。 (2). 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定规则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1，并且进程等待的时间超过某一时限（2个时间片时间）时增加其优先数等。 (3).
Fibonacci
- Fibonacci Sequence that do the sequence right about Da Vinci Code, it s a great algorithm for ordering tasks
graphpartition
- MATLAB function to partition very large graphs very fast. This function implements a graph partitioning algorithm based on spectral factorization. This algorithm is described in the following technical report: Joã o Hespanha. An efficient MA
dsdv
- Destination-Sequenced Distance-Vector Routing (DSDV) is a table-driven routing scheme for ad hoc mobile networks based on the Bellman–Ford algorithm
apache-tomcat-6.0.43
- my best algorithm is a very good software that can be used by every one
four-element
- 这是一个编译原理，四元式生成的C++代码。希望能在算法结构和逻辑上给予大家一些帮助。-This is a compiler theory, four-element type generated C++ code. We can give you some help in the algorithm structure and logic.
bdcm-fb
- This paper aims to design a static series synchronous compensator (SSSC) controller based on an optimal multi-objective simulated annealing algorithm - This paper aims to design a static series synchronous compensator (SSSC) controller bas
fuzzy-code
- here i am representing a Fuzzy C mean clustering algorithm java source code
Simplification-of-grammar
- 设计文法类，实现对文法G[S]=(Vt, Vn, P, S)的文件读写，文法的文件表示形式以及内存表示形式可自定义。本质上，文法就是3个集合+1个符号，重点（难点）是产生式集合如何处理。文法的文本形式可根据自己需要自由定义。在前述的基础上，实现文法化简的无用符号及无用产生式消除算法。 -Grammar class design, to achieve the grammar G [S] = (Vt, Vn, P, S) to read and write files, grammar fil
myMatlab-code
- In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm is a member of the
ypea104-acor
- continuous ACO. In computer science and operations research, the ant colony optimization algorithm (ACO) is a probabilistic technique for solving computational problems which can be reduced to finding good paths through graphs. This algorithm