Location:
Search - resident
Search list
Description: tsr驻留程序的演示源程序-tsr resident program demonstration source program
Platform: |
Size: 15360 |
Author: 晨风 |
Hits:
Description: 身份证号码生成器(JAVA版),感兴趣的朋友过来看一下,有需要改进的地方.望不吝赐教-identity card number generator (Java version), interested friends and see that there is a need for improvement. Look wing
Platform: |
Size: 11264 |
Author: 许斌 |
Hits:
Description: 货郎担分枝限界图形演示
问题描述:某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman Branch and Bound graphic demonstration Problem description : A salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
Platform: |
Size: 4096 |
Author: 林周 |
Hits:
Description: 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条
从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
VC 旅行商问题源代码-带有图形功能.-a salesman to a number of cities to sell commodities, the known distance between cities (or travel). He selected a departure from the resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. VC TSP source code- with graphics capabilities.
Platform: |
Size: 283648 |
Author: 绍生 |
Hits:
Description: 程序是用来布置软件界面。使用户具有友好的入口。本程序没有特殊功能，仅由主程序调用进行初始化界面，是主程序的子程序。程序采用顺序处理。非常驻内存。无覆盖要求。可重人 -procedure is used to layout software interface. Enables users with a friendly entrance. No special procedures of the functional only by the main program called initialization interface, is the main program subroutine. Adoption of the order processing. Non-resident memory. Without coverage requirements. Can committees
Platform: |
Size: 1024 |
Author: zjjking |
Hits:
Description: 程序是用来布置软件界面。使用户具有友好的入口。本程序没有特殊功能，仅由主程序调用进行初始化界面，是主程序的子程序。程序采用顺序处理。非常驻内存。无覆盖要求。可重人 -procedure is used to layout software interface. Enables users with a friendly entrance. No special procedures of the functional only by the main program called initialization interface, is the main program subroutine. Adoption of the order processing. Non-resident memory. Without coverage requirements. Can committees
Platform: |
Size: 112640 |
Author: zjjking |
Hits:
Description: 本程序是用来将客户选定图书放入购书车。使用户对图书的购买信息有详细的了解，暂时确定购书者的列表。这是本项目的关键，是实现购书的关键。是主程序的子程序。程序采用顺序处理。非常驻内存。无覆盖要求。可重人-this program is to be used for customer selected books Add car buyers. Allows users to purchase books have detailed information to understand, temporarily set Buyers lists. This is the key to the project is the key to achieving the buyers. The main program is a subprogram. Adoption of the order processing. Non-resident memory. Without coverage requirements. Can committees
Platform: |
Size: 30720 |
Author: zjjking |
Hits:
Description: 本程序是用来将客户选定图书放入购书车。使用户对图书的购买信息有详细的了解，暂时确定购书者的列表。这是本项目的关键，是实现购书的关键。是主程序的子程序。程序采用顺序处理。非常驻内存。无覆盖要求。可重人-this program is to be used for customer selected books Add car buyers. Allows users to purchase books have detailed information to understand, temporarily set Buyers lists. This is the key to the project is the key to achieving the buyers. The main program is a subprogram. Adoption of the order processing. Non-resident memory. Without coverage requirements. Can committees
Platform: |
Size: 29696 |
Author: zjjking |
Hits:
Description: A memory-resident utility that enables selectable use of the
extended screen and keyboard control sequences that normally require loading the
ANSI.SYS device driver. Unlike ANSI.SYS, ANSI.COM supports all video modes,
permits sizing and clearing the key-assignment buffer, and provides high-speed
screen updating.-A memory-resident utility that enables se lectable use of the extended screen and keyboar d control sequences that normally require load ing the ANSI.SYS device driver. Unlike ANSI.SY S, ANSI.COM supports all video modes, permits sizing and clearing the key-assignmen t buffer, and provides high-speed screen updating.
Platform: |
Size: 282624 |
Author: 郭治 |
Hits:
Description: 旅行商问题：
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-traveling salesman problem : A salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
Platform: |
Size: 56320 |
Author: 章为到 |
Hits:
Description: 旅行商问题（动态规化）
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
-traveling salesman problem (dynamic regulation of) a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between cities
Platform: |
Size: 59392 |
Author: 586 |
Hits:
Description: 旅行商问题动态规划算法的应用
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
-TSP dynamic programming algorithm of a salesman to a number of cities to sell commodities, known the distance between cities (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest.
Platform: |
Size: 61440 |
Author: 586 |
Hits:
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
最优路线是1,3,2,4,1，
其最短路程是25-a salesman, traveling salesman problem, a number of cities to sell commodities, the known distance between the city (or travel). He selected from a resident, after each city again, the last resident to return to the line, making the total distance (or travel) is the smallest. For example : given four cities (1,2,3,4) and the distance between the city optimal route is 1,3,2,4, 1, the shortest distance is 25
Platform: |
Size: 39936 |
Author: 吴博 |
Hits:
Description: _移位实现
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-_ Shift to achieve a salesman to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest.
Platform: |
Size: 79872 |
Author: 战天 |
Hits:
Description: (1).问题描述：旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要
选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（
或旅费）最小。
(2).程序设计要求：
a. 设计一个动态规划算法
b. 任给一个输入实例，能输出最短路程及其路线
c. 能用图形演示旅行商的推销路线
输入要测试的文件名，如TSP6.txt,程序将利用动态规划求解该问题，给出最佳线
路，并用图形演示。-(1). Problem Description: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest. (2). Program design requirements: a. the design of a dynamic programming algorithm to an input b. any examples, can output the shortest distance and the line c. use graphical presentation of the traveling salesman selling line of input to test the file name, such as TSP6 . txt, the procedure will use dynamic programming to solve the problem, given the best lines, and graphics presentation.
Platform: |
Size: 10240 |
Author: 小明 |
Hits:
Description: 旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
例如：给定4个城市{1，2，3，4}及其各城市之间的路程
最优路线是1,3,2,4,1，
其最短路程是25
-Traveling Salesman Problem of a salesman to a number of cities to sell commodities, known distance between cities (or travel). Him to select a departure from the resident, through every city once again, and finally returned to the resident
Platform: |
Size: 274432 |
Author: zhengyy |
Hits:
Description: 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。
里面附有详细报告。-A salesman to a number of cities to sell commodities, known distance between cities (or travel). Him to select a departure from the resident, through every city once again, and finally returned to the resident
Platform: |
Size: 237568 |
Author: gillli |
Hits:
Description: 某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（或旅费）最小。-A salesman to a number of cities to sell commodities, known distance between cities (or travel). Him to select a departure from the resident, through every city once again, and finally returned to the resident
Platform: |
Size: 370688 |
Author: hehe |
Hits:
Description: 可以支持 ASP 方式发送密码，并可以直接生成ASP接收文件
可以支持 EMAIL方式发送密码。
只需要极小权限，只要能对魔兽安装目录进行操作，就可以成功安装和使用。
不改动系统注册表不易察觉，无任何启动项。
进程存在时间短，不长驻内存。只在输入密码时启动。-Can support ASP send password, and can receive documents directly generate ASP can support EMAIL send password. Only a very small authority, as long as they can on the operation of Warcraft installation directory, you can successfully install and use. Without changing the system registry can not easily be detected without any startup items. The process of the existence of time is short, non-resident memory. Only enter a password at startup.
Platform: |
Size: 3072 |
Author: longkeyy |
Hits:
Description: 运用优化遗传算法解决100个城市的TSP问题，即要选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程最小。-Optimize the use of genetic algorithms to solve 100 cities TSP problem, which was to select a departure from the resident, after each city once again, and finally returned to the resident s line, bringing the total minimum distance.
Platform: |
Size: 1235968 |
Author: 李佳鹤 |
Hits: