Sciweavers

4860 search results - page 45 / 972
» SNPs Problems, Complexity, and Algorithms
Sort
View
ICICIC
2006
IEEE
14 years 1 months ago
An Ant Colony Optimization Algorithm for Multiple Travelling Salesman Problem
Multiple travelling salesman problem (MTSP) is a typical computationally complex combinatorial optimization problem,which is an extension of the famous travelling salesman problem...
Pan Junjie, Wang Dingwei
IEEECIT
2010
IEEE
13 years 6 months ago
Non-recursive Algorithm of Tower of Hanoi Problem
—As we all know, Hanoi Problem is a classical case of recursive algorithm in programming. In this paper, we study the problem in another way by numbering the peg from bottom to t...
Fuwan Ren, Qifan Yang, Jiexin Zheng, Hui Yan
ICTCS
2005
Springer
14 years 1 months ago
Quantum Algorithms for a Set of Group Theoretic Problems
This work introduces two decision problems, StabilizerD and Orbit CosetD, and gives quantum reductions from them to the problem Orbit Superposition (Friedl et al., 2003), as well a...
Stephen A. Fenner, Yong Zhang
GECCO
2005
Springer
158views Optimization» more  GECCO 2005»
14 years 1 months ago
Transition models as an incremental approach for problem solving in evolutionary algorithms
This paper proposes an incremental approach for building solutions using evolutionary computation. It presents a simple evolutionary model called a Transition model in which parti...
Anne Defaweux, Tom Lenaerts, Jano I. van Hemert, J...
INFOVIS
2000
IEEE
14 years 33 min ago
Interactive Problem Solving via Algorithm Visualization
COMIND is a tool for conceptual design of industrial products. It helps designers define and evaluate the initial design space by using search algorithms to generate sets of feasi...
Pearl Pu, Denis Lalanne