搜索资源列表
Data Structures And Problem Solving Java Source Co
- 这是数据结构与问题求解的Java版的源码-This is the data structure and problem solving version of the Java source code
eating-apple-problem
- 吃苹果eating apple problem问题代码-eat apples problem was eating apple code
reader-writer-problem
- reader-writer-problem读者写者问题代码-reader-writer-problem readers to write code problem
Vehicle-Routing-Problem
- 车辆行驶路线优化（Vehicle Routing Problem）-traffic route optimization (Vehicle Routing Problem)
use GA to deal with except-value problem
- 遗传算法解决随机期望值模型问题的例题-random genetic algorithms to solve the problem expectations model example
AN EXPERIMENTAL TABU SEARCH CODE FOR THE N-QUEENS PROBLEM
- AN EXPERIMENTAL TABU SEARCH CODE FOR THE N-QUEENS PROBLEM
matlab for TSP problem
- matlab code writen by somebody for TSP problem with tabu search
求解Knight Tour Problem
- 求解Knight Tour Problem，马的走法是“日”字形路线，例如当马在位置15的时候，它可以到达2、4、7、11、19、23、26和28。但是规定马是不能跳出棋盘外的，例如从位置1只能到达9和14
particle_swarm_optimization-Solve-the-TSP-problem.
- 基于粒子群优化算法（PSO）的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Based on Particle Swarm Optimization (PSO) of the 50 cities TSP problem solving can be extended to a similar NP-hard problem.
producer-consumer-problem
- Introduction In this project, we will design a programming solution to the bounded-buffer problem using the producer and consumer processes . The solution uses three semaphores: empty and full, which count the number of empty and full slots
0-1-knapsack-problem
- 模拟退火解决0-1背包问题，初学者可以借鉴-Simulated annealing to solve 0-1 knapsack problem, beginners can learn from
genetic_algorithm-Solve-the-TSP-problem
- 基于遗传算法的50个城市TSP问题的求解，可推广至类似NP-hard问题。-Genetic Algorithm Based on 50 cities TSP problem solving can be extended to a similar NP-hard problem.
matlab-mtsp-problem
- 这是一篇关于多旅行商问题的学术论文，非常有新意，非常有利于我们深入了解mtsp问题的本质-This is a multi-traveling salesman problem on the papers, very fresh, very beneficial to our in-depth understanding of the nature of the problem mtsp
Chinese-postman-problem-for-DNA-computing
- 中国邮递员问题的DNA计算，从学校的数据资源库里找着的，感觉不错，在此向大家支持一下-Chinese postman problem for DNA computing, data resources from the school library found, an excuse, and feel good, look at this opportunity to Members to support the
partition+problem
- partition problem to divide a group in to 2 equal sets
Machine-Scheduling-Problem
- mechine scheduling problem
Data-Abstraction-and-Problem-Solving-with-Java_co
- Data Abstraction and Problem Solving with Java - code1
Mazing-Problem
- 迷宫问题 以一个m*n的长方阵表示迷宫，0和1分别表示迷宫中的通路和障碍。设计一个程序，对任意设定的迷宫，求出一条从入口到出口的通路，或得出没有通路的结论。 基本要求： （1）首先实现一个以链表作存储结构的栈类型，然后编写一个求解迷宫的非递归程序。求得的通路以三元组(i,j,d)的形式输出，其中(i,j)指示迷宫中的一个坐标，d表示走到下一坐标的方向。 （2）测试几组数据，数据的规模由小变大，即网格越来越小，障碍越来越复杂。 拓展要求： 实现该问题的可视化界面，用鼠标点
Josephus--problem
- 约瑟夫斯（Josephus）问题的一种描述是：编号为1，2，…，n的n个人按顺时针方向围坐一圈，每人持有一个密码（正整数）。一开始任选一个正整数作为报数上限值m，从第一个人开始按顺时针方向自1开始报数，报到m时停止报数。报m的人出列，将他的密码作为新的m值，从他在顺时针方向下一个人开始重新从1报数，如此下去，直至所有的人全部出列为止。试设计一个程序，按出列顺序印出各人编号。-Josephus (Josephus) a descr iption of the problem are: number
josephus problem
- 分别通过顺序表和链表的方式，利用C++实现约瑟夫斯问题(C++ implementation of the Josephus problem)