搜索资源列表
KnapsackProblem
- 0/1背包问题的几种解法，包括回溯法、动态规划法以及穷举法。另外还包括集中方法的一个测试报告。-0/1 knapsack problem several solutions, including backtracking, dynamic programming method and the exhaustive method. It also includes a focus on methods of test reports.
frame
- 用回溯法解决不是很麻烦的传教士和野人问题-By backtracking to solve is not very troublesome issue of missionaries and Savage
jingdiansuanf
- 二叉树的递归与非递归遍历(Java描述)，高效实现Josephus算法，合并有序链表，基于队列实现的基数排序，栈.回溯.迷宫问题求解。5个算法的源程序。-Recursive and non recursive binary tree traversal (Java descr iption), efficient algorithms to achieve Josephus, merging sorted linked list, queue-based implementation of ra
MC
- Java实现，用回溯的方法解决n，k下的传教士野人问题。最后输出一个字符串数组，表示渡河过程-Java implementation, with the back of a solution n, k missionaries under the savage problems. The final output of a string array that cross the river course
java_n_queen
- 使用java语言， 回溯法实现n后问题和0－1背包问题-java huisu suanfa slove N Queen question
Three
- recall.c：回溯法求有向图是否存在回路，将结果输出到文件中。dfs.c：深度优先搜索解决N皇后问题，结果输出到文件。Client.java：一个java编写的即时通讯小程序。-recall. depth-first search. Instant message.
acmkdtree
- kdtree java 实现。。 实现了一个sql优化，减少了回溯次数，家少了执行时间-The kdtree java. . . . A sql optimization, reduce the number of backtracking, the home less execution time
Queens
- 八皇后,回溯法,JAVA实现,1维数组,可列出所有可行解-Eight Queens, backtracking, JAVA implementation, one-dimensional arrays, lists all feasible solutions
HorseTravel
- 用Java实现的回溯法 用预见算法解骑士游历问题。-Java implementation of backtracking
strategyback1509521711977
- 我在用jetty+cometd做comet服务，continuation机制已经加入，但是日志中出现了这样的异常(WARN:oejs.HttpChannel:qtp607635164-14195: Commit failed java.util.concurrent.TimeoutException: Idle timeout expired: 30000/30000 ms at org.eclipse.jetty.io.IdleTimeout.checkIdleTimeout(IdleTi