八数码难题至今仍然是难以真正解决的NP-hard,这里仅提供了一种实现，当然里面难免存在bug.
上传时间： 2013-12-22
上传用户：pompey
NP-hard问题分析 NP-hard问题分析
上传时间： 2016-12-15
上传用户：yy541071797
使用进化计算算法解决TSP（Travelling Sales man Problem）问题的算法实现。程序显示了进化计算在解决NP-hard的传统难题上的优势。
标签： Travelling Problem NP-hard Sales
上传时间： 2014-01-22
上传用户：wys0120
英文资料。利用蚁群算法正反馈、并行计算的优点，将蚁群算法用于求解典型的NP-hard问题—旅行商问题。
上传时间： 2015-10-16
上传用户：
The combinatorial core of the OVSF code assignment problem that arises in UMTS is to assign some nodes of a complete binary tree of height h (the code tree) to n simultaneous connections, such that no two assigned nodes (codes) are on the same root-to-leaf path. Each connection requires a code on a specified level. The code can change over time as long as it is still on the same level. We consider the one-step code assignment problem: Given an assignment, move the minimum number of codes to serve a new request. Minn and Siu proposed the so-called DCAalgorithm to solve the problem optimally. We show that DCA does not always return an optimal solution, and that the problem is NP-hard. We give an exact nO(h)-time algorithm, and a polynomial time greedy algorithm that achieves approximation ratio Θ(h). Finally, we consider the online code assignment problem for which we derive several results
标签： combinatorial assignment problem arises
上传时间： 2014-01-19
上传用户：BIBI
Accessing IDE Hard disk by ATmega32 microcontroller (Proteus simulation include)
标签： microcontroller simulation Accessing Proteus
上传时间： 2013-09-21
上传用户：18888888888
关于经典NP问题的处理！
标签：
上传时间： 2013-12-30
上传用户：zjf3110
在UNIX 系统下得到字符点阵信息嵌入式系统设计中消除内存丢失的策略matlab循环变量小技巧hard disk 1.8# device driverC程序中如何转换GB2312
标签： driverC matlab device UNIX
上传时间： 2015-03-23
上传用户：lili123
这篇论文描述了一种设计Hard Real Time System的结构方法HRT-HOOD，由York大学的两位教授提出，York大学的Real Time System Group是关于实时系统研究的世界领先机构，研究内容具体可以登陆York的网站，或者参考出版书籍：Real Time Systems and Programming Languages.
上传时间： 2015-04-12
上传用户：气温达上千万的
In case you haven t realized it, building computer systems is hard. As the complexity of the system gets greater, the task of building the software gets exponentially harder. As in any profession, we can progress only by learning, both from our mistakes and from our successes. This book represents some of this learning written in a form that I hope will help you to learn these lessons quicker than I did, or to communicate to others more effectively than I did before I boiled these patterns down.
标签： complexity the building computer
上传时间： 2015-04-25
上传用户：tyler
