搜索资源列表
Interrupt
- 很全的中断手册。 INT 00 - CPU-generated - DIVIDE ERROR INT 01 - CPU-generated - SINGLE STEP (80386+) - DEBUGGING EXCEPTIONS INT 02 - external hardware - NON-MASKABLE INTERRUPT INT 03 - CPU-generated - BREAKPOINT INT 04
INTEL_FLASH_DRIVER
- BY USING THIS SOFTWARE, YOU ARE AGREEING TO BE BOUND BY THE TERMS OF * THIS AGREEMENT. DO NOT USE THE SOFTWARE UNTIL YOU HAVE CAREFULLY * READ AND AGREED TO THE FOLLOWING TERMS AND CONDITIONS.
bound
- 用GPU实现碰撞检测，并运用了定点程序和片断程序；
分枝定界算法
- 分枝定界算法描述，文本形式！-branch-and-bound algorithm descr iption, in text form!
UART
- 用FPGA实现了RS232异步串行通信，所用语言是VHDL，另外本人还有Verilog的欢迎交流学习，根据RS232 异步串行通信来的帧格式，在FPGA发送模块中采用的每一帧格式为：1位开始位+8位数据位+1位奇校验位+1位停止位，波特率为2400。由设置的波特率可以算出分频系数，具体算法为分频系数X=CLK/(BOUND*2)。
040320131
- 最小圆排列的分支限界法！ 用了很好的剪支策略很快的！-smallest circle with a branch and bound method! With a good strategy for cutting sticks soon!
BRANCH
- 分枝定界法，运筹学-branch-and-bound method, and operations
connpoints
- SUMMARY Since a Visual Basic client doesn t handle events directly from late-bound COM objects, it needs some way to capture all the events and parameters launched by any COM object server instantiated at runtime and not
oledb-3
- Adding bookmark functionality is relatively easy and it enables our ADO recordset to be used with a greater number of data bound controls. 给DataBound控件增加书签功能(52KB)
货郎担限界算法A
- 货郎担限界算法 c语言-traveling salesman Bound algorithm language c
LCbb_TSP
- LC分枝限界法解货郎担—代码-LC Branch and Bound Solving traveling salesman - code
分支限界法_单源最短路径
- 算法设计的分支限界法中的单源最短路径问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of single source shortest path to the realization of the problem is with VC + + prepared
分支限界法_批处理作业调度
- 算法设计中的分支限界法中的批处理作业调度问题的实现，是用VC＋＋编写的-algorithm design of branch and bound method of batch job scheduling problem is true, VC + + prepared
ExeBinder
- 文件合并分离器，平时看到很多文件捆绑器，可是要分析其程序必须要分离，从网上找到的不是太好用，也不可控，就自己做了1个-merger document separator, usually see a lot of paper-bound, but should analyze its procedures must be separated from the Internet is not handy, nor controllable
分支与界法
- 图论中使用分支与界法求解旅行商问题，直接在vc中编译可运行-graph theory with the use of branch and bound for traveling salesman problem, which directly vc compiler can run
以K－均值聚类结果为初始解的模拟退火聚类
- 由于K－均值聚类算法局部最优的特点，而模拟退火算法理论上具有全局最优的特点。因此，用模拟退火算法对聚类进行了改进。20组聚类仿真表明，平均每次对K结果值改进8次左右，效果显著。下一步工作：实际上在高温区随机生成邻域是个组合爆炸问题（见本人上载软件‘k－均值聚类算法’所述），高温跳出局部解的概率几乎为0，因此正考虑采用凸包约束进行模拟聚类，相关工作正在进行。很快将奉献给各位朋友。-as K-means clustering algorit
子集和问题
- 子集和问题.rar:这是我学算法设计时的总结,包括定长和不定长做法(也就是回朔法,剪枝限界),当然也包括穷举法.-subset and problems. Rar : This is my learning algorithm design at the conclusion, including fixed-length and variable length approach (that is, back to Schomburg,
货郎担分枝限界算法图形
- 货郎担 分枝限界算法图形求解货郎担问题的分枝限界算法图形演示-traveling salesman Branch and Bound graphics algorithm to solve the traveling salesman problem Branch and Bound algorithm graphic demonstration
dynamic knapsack
- 该程序用动态规划解决经典的背包问题,虽然它的效率与分支定界法比起来,还是有一定的差距,但它的简洁性却是无与伦比的.-the program with dynamic programming solution to the classic knapsack problem, although its efficiency and branch and bound over, there is still a certain gap, bu
翻译材料
- 外观模拟分支定界 分支定界 -appearance simulation branch delimitation of branch-and-bound branch d elimitation of branch-and-bound branch delimitation of branch-and-bound