Bairstow Problem. We can find any n th polynomial problem.
Bairstow Problem. We can find any n th polynomial problem....
problem-solving技术资料
📦 资源总数：438
💻 源代码：16700
📚 problem-solving全部资料 (438个)
使用进化计算算法解决TSP（Travelling Sales man Problem）问题的算法实现。程序显示了进化计算在解决NP-Hard的传统难题上的优势。
使用进化计算算法解决TSP（Travelling Sales man Problem）问题的算法实现。程序显示了进化计算在解决NP-Hard的传统难题上的优势。...
it is possible to help with this program. hope to solve your problem with it
it is possible to help with this program. hope to solve your problem with it...
PseudoQ is an open source java application for creating, playing and solving SuDoku puzzles of vario
PseudoQ is an open source java application for creating, playing and solving SuDoku puzzles of vario...
this modified PSO algorithm can solve for constrained optimization problem
this modified PSO algorithm can solve for constrained optimization problem...
旅行商问题（Travelling Salesman Problem, 简记TSP
旅行商问题（Travelling Salesman Problem, 简记TSP，亦称货郎担问题)：设有n个城市和距离矩阵D=[dij]，其中dij表示城市i到城市j的距离，i，j=1，2 … n，则...
GA for single machin problem
GA for single machin problem...
GA2 for single Machin Problem
GA2 for single Machin Problem...
GA3 for single machin problem
GA3 for single machin problem...
Finite element program for mechanical problem. It can solve various problem in solid problem
Finite element program for mechanical problem. It can solve various problem in solid problem...