搜索资源列表
My0search
- 错误查找帮助工具，词法、语法分析器,毕业设计模块，。看到现在好多做VC的新手，因为需要查找一个功能，把别人的代码复制过来，但是左比较右比较就是找不到错误，这个程序帮助大家这个烦恼，只要你有想法，什么自己也能够实现的。-tool to help identify errors, morphology, syntax analyzer, a graduate design module. See that the VC so many newcomers because of the need to
redoundo
- Functorized Undo/Redo .The idea to marry the algorithm with the functor was encouraging and this is example code for it-Functorized Undo/Redo .The idea to marry the algorithm with the functor was encouraging and this is example code for it
LZ78encodinganddecoding
- LZ78的编码思想是不断地从字符流中提取新的“缀-符串(String)”（通俗地理解为新“词条”），然后用“代号”也就是码字(Code word)表示这个“词条”。这样一来，对字符流的编码就变成了用码字(Code word)去替换字符流，生成码字流，从而达到压缩数据的目的。 -LZ78 encoding idea is to continually extracted from the character stream the new " infix- character string
201191314588027
- 一个简单的PDF格式文件阅读器，为大家提供一种思路。 -A simple PDF file reader, provide an idea.
zuop
- 本软件的设计思路是参考windows自带的记事本的功能和框架，用Java语言编写一个记事本。可以实现大多数基本功能。如文件的新建、打开、保存、另存为、退出。内容的复制、粘贴、删除、查找-The idea is to design software windows notepad for reference to the functions and framework, using the Java language to write a notepad. Most basic functions
fwdisingmodel
- Monte Carlo simulation methods and their idea of ferromagnetic- paramagnetic phase transition process. Paramagnetic material calculated average energy Ev, heat capacity Cv, magnetization M and susceptibilit
ProcScheduling
- 编写并调试一个模拟的进程调度程序，采用“最高优先数优先”调度算法对N（N不小于5）个进程进行调度。 “最高优先数优先”调度算法的基本思想是把CPU分配给就绪队列中优先数最高的进程。 (1). 静态优先数是在创建进程时确定的，并在整个进程运行期间不再改变。 (2). 动态优先数是指进程的优先数在创建进程时可以给定一个初始值，并且可以按一定规则修改优先数。例如：在进程获得一次CPU后就将其优先数减少1，并且进程等待的时间超过某一时限（2个时间片时间）时增加其优先数等。 (3).
Code(6)
- As the figure above illustrates, a phase accumulator compares the sample clock and desired frequency to increment a phase register. Again, the fundamental idea is that we can generate signals with precise frequencies by generating an appropriate samp
subdivide1
- What are Subdivision Surfaces? The idea of subdivision surfaces was first introduced by Catmull & Clark and Doo & Sabin in 1978. Unlike traditional spline surfaces, subdivision surfaces are defined algorithmically. Recently there has been a lot
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