搜索结果

找到约 469 项符合 Problem 的查询结果
相关度 上传时间 下载量 查看数
共 469 条结果

按分类筛选

显示更多分类

人工智能/神经网络 solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graph

solve the 8-puzzle problem using A* algorithm. Definitely written by my self, also include BGI graphics library output.
https://www.eeworm.com/dl/650/176530.html
下载: 149
查看: 1311

数据结构 zju 1025 Wooden Sticks http://acm.zju.edu.cn/show_problem.php?pid=1025

zju 1025 Wooden Sticks http://acm.zju.edu.cn/show_problem.php?pid=1025
https://www.eeworm.com/dl/654/208835.html
下载: 139
查看: 1100

数据结构 zju 1056 The Worm Turns http://acm.zju.edu.cn/show_problem.php?pid=1056

zju 1056 The Worm Turns http://acm.zju.edu.cn/show_problem.php?pid=1056
https://www.eeworm.com/dl/654/208841.html
下载: 42
查看: 1570

matlab例程 Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助

Using Ant Colony Optimization Algorithm to solve Traveling Salesman Problem.对此方面的研究很有帮助
https://www.eeworm.com/dl/665/237672.html
下载: 97
查看: 1086

数据结构 优化算法loqo的算法源代码。Purpose: solves quadratic programming problem for pattern recognition for support vec

优化算法loqo的算法源代码。Purpose: solves quadratic programming problem for pattern recognition for support vectors
https://www.eeworm.com/dl/654/281576.html
下载: 103
查看: 1103

数值算法/人工智能 遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of

遗传算法和“货郎担” 问题: "The traveling salesman problem, or TSP for short, is this: given a finite number of cities along with the cost of travel between each pair of them, find the cheapest way of visiting all the cities and returning to your starting point."
https://www.eeworm.com/dl/518/289394.html
下载: 111
查看: 1084

人工智能/神经网络 用经典算法--模拟退火算法求解经典问题旅行商（Travel Sales Problem）问题。

用经典算法--模拟退火算法求解经典问题旅行商（Travel Sales Problem）问题。
https://www.eeworm.com/dl/650/298253.html
下载: 185
查看: 1104

数据结构 经典数据结构外国教材Data Abstraction & Problem Solving with C++.的源代码

经典数据结构外国教材Data Abstraction & Problem Solving with C++.的源代码
https://www.eeworm.com/dl/654/325840.html
下载: 136
查看: 1117

软件设计/软件工程 linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)

linux用多线程同步方法解决哲学家就餐问题(Dining-Philosophers Problem)
https://www.eeworm.com/dl/684/334798.html
下载: 32
查看: 1138

数学计算 Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... &l

Problem B:Longest Ordered Subsequence A numeric sequence of ai is ordered if a1 < a2 < ... < aN. Let the subsequence of the given numeric sequence (a1, a2, ..., aN) be any sequence (ai1, ai2, ..., aiK), where 1 <= i1 < i2 < ... < iK <= N. For example, sequence (1, 7, 3, 5, 9, 4, 8) has ordered subse ...
https://www.eeworm.com/dl/641/376407.html
下载: 20
查看: 1655