<li id="aomcg"></li> 八數(shù)碼難題至今仍然是難以真正解決的np-Hard,這里僅提供了一種實(shí)現(xiàn)，當(dāng)然里面難免存在bug.
上傳時(shí)間： 2013-12-22
上傳用戶：pompey
np-Hard問(wèn)題分析 np-Hard問(wèn)題分析
上傳時(shí)間： 2016-12-15
上傳用戶：yy541071797
使用進(jìn)化計(jì)算算法解決TSP（Travelling Sales man Problem）問(wèn)題的算法實(shí)現(xiàn)。程序顯示了進(jìn)化計(jì)算在解決np-Hard的傳統(tǒng)難題上的優(yōu)勢(shì)。
標(biāo)簽： Travelling Problem np-Hard Sales
上傳時(shí)間： 2014-01-22
上傳用戶：wys0120
英文資料。利用蟻群算法正反饋、并行計(jì)算的優(yōu)點(diǎn)，將蟻群算法用于求解典型的np-Hard問(wèn)題—旅行商問(wèn)題。
標(biāo)簽： 英文 正反饋 并行計(jì)算 蟻群算法
上傳時(shí)間： 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
標(biāo)簽： combinatorial assignment problem arises
上傳時(shí)間： 2014-01-19
上傳用戶：BIBI
Accessing IDE Hard disk by ATmega32 microcontroller (Proteus simulation include)
標(biāo)簽： microcontroller simulation Accessing Proteus
上傳時(shí)間： 2013-09-21
上傳用戶：18888888888
關(guān)于經(jīng)典NP問(wèn)題的處理！
標(biāo)簽：
上傳時(shí)間： 2013-12-30
上傳用戶：zjf3110
在UNIX 系統(tǒng)下得到字符點(diǎn)陣信息嵌入式系統(tǒng)設(shè)計(jì)中消除內(nèi)存丟失的策略matlab循環(huán)變量小技巧hard disk 1.8# device driverC程序中如何轉(zhuǎn)換GB2312
標(biāo)簽： driverC matlab device UNIX
上傳時(shí)間： 2015-03-23
上傳用戶：lili123
這篇論文描述了一種設(shè)計(jì)Hard Real Time System的結(jié)構(gòu)方法HRT-HOOD，由York大學(xué)的兩位教授提出，York大學(xué)的Real Time System Group是關(guān)于實(shí)時(shí)系統(tǒng)研究的世界領(lǐng)先機(jī)構(gòu)，研究?jī)?nèi)容具體可以登陸York的網(wǎng)站，或者參考出版書(shū)籍：Real Time Systems and Programming Languages.
標(biāo)簽： HRT-HOOD System Hard Real
上傳時(shí)間： 2015-04-12
上傳用戶：氣溫達(dá)上千萬(wàn)的
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.
標(biāo)簽： complexity the building computer
上傳時(shí)間： 2015-04-25
上傳用戶：tyler
蟲(chóng)蟲(chóng)下載站版權(quán)所有 京ICP備2021023401號(hào)-1
