<s id="wskwg"></s> ％this program is written by 劉學(xué)智. Finished time is 05.1.23 16:03 ％utilizing it solving TSP problem by simulating stealing algorithm
標(biāo)簽： utilizing Finished program problem
上傳時(shí)間： 2014-01-24
上傳用戶：遠(yuǎn)遠(yuǎn)ssad
traveling saleman problem的代碼
標(biāo)簽： traveling saleman problem 代碼
上傳時(shí)間： 2014-01-03
上傳用戶：yph853211
traveling saleman problem的一個(gè)Ｃ＋＋算法
標(biāo)簽： traveling saleman problem 算法
上傳時(shí)間： 2015-10-08
上傳用戶：水口鴻勝電器
With the release of PHP 5 web developers need a guide to developing with PHP 5 to both learn its complex new features and more fully implement the long-standing features on which PHP s success is built. PHP 5 in Practice is a reference guide that provides developers with easy-to-use and easily extensible code to solve common PHP problems. It focuses on providing real code solutions to problems, allowing the reader to learn by seeing exactly what is happening behind the scenes to get your solution. Because a real-life situation will rarely match the book s example problems precisely, PHP 5 in Practice explains the solution well enough that you will understand it and can learn how to truly solve your own problem.
標(biāo)簽： developers developing PHP release
上傳時(shí)間： 2013-12-17
上傳用戶：xzt
主要解決旅行商問題(traveling saleman problem,簡稱tsp，即已知n個(gè)城市之間的相互距離，現(xiàn)有一個(gè)推銷員必須遍訪這n個(gè)城市，并且每個(gè)城市只能訪問一次，最后又必須返回出發(fā)城市，求解最短距離的遺傳算法。
標(biāo)簽： traveling saleman problem tsp
上傳時(shí)間： 2015-10-09
上傳用戶：cylnpy
基于VC～++60開發(fā)設(shè)計(jì)的人事管理系統(tǒng),adobe reader閱讀，數(shù)據(jù)庫編程資料
標(biāo)簽： reader adobe 60 開發(fā)設(shè)計(jì)
上傳時(shí)間： 2014-11-12
上傳用戶：日光微瀾
用于求解TSP(Traveling salesman problem，旅行商問題)問題，基本執(zhí)行見run.bat, 其它詳見其中的readme.txt。（實(shí)例為TSPLIB格式，見myprojects目錄，包括eil51, d198, lin318等小型問題，以及1000到3000城市之間的例子，基本能得到最優(yōu)解）
標(biāo)簽： Traveling salesman problem TSP
上傳時(shí)間： 2015-10-16
上傳用戶：myworkpost
本程序是Alien公司的reader開發(fā)程序例子，讀出class1的tag的值。
上傳時(shí)間： 2015-10-19
上傳用戶：songyue1991
Organized in a practical problem-and-solution format, More Exceptional C++ picks up where the widely acclaimed Exceptional C++ leaves off, providing successful strategies for solving real-world problems in C++. Drawing from years of in-the-trenches experience, Herb Sutter provides tested techniques and practical solutions for programmers designing modern software systems with C++, from small projects to enterprise applications.
標(biāo)簽： problem-and-solution Exceptional Organized practical
上傳時(shí)間： 2015-10-20
上傳用戶：chenbhdt
This paper studies the problem of categorical data clustering, especially for transactional data characterized by high dimensionality and large volume. Starting from a heuristic method of increasing the height-to-width ratio of the cluster histogram, we develop a novel algorithm – CLOPE, which is very fast and scalable, while being quite effective. We demonstrate the performance of our algorithm on two real world
標(biāo)簽： data transactional categorical clustering
上傳時(shí)間： 2015-10-24
上傳用戶：evil
蟲蟲下載站版權(quán)所有 京ICP備2021023401號-1
<abbr id="iqaiu"></abbr>