599 search results - page 31 / 120 » The traveling salesman problem |
118
Voted
FLAIRS
2010
14 years 10 months ago
2010
The choice of a good annealing schedule is necessary for good performance of simulated annealing for combinatorial optimization problems. In this paper, we pose the simulated anne...
116
click to vote
COGSCI
2010
15 years 19 days ago
2010
With only two to five slots of visual working memory (VWM), humans are able to quickly solve complex visual problems to near optimal solutions. To explain the paradox between tigh...
100
Voted
HEURISTICS
2007
15 years 14 days ago
2007
In this paper, we develop and discuss several distance measures for permutation type representations of solutions of combinatorial optimisation problems. The problems discussed in...
118
Voted
SASO
2007
IEEE
15 years 6 months ago
2007
IEEE
Multi-agent systems (MAS) provide a promising technology for addressing problems such as search and rescue missions, mine sweeping, and surveillance. These problems are a form of ...
165
Voted
FPGA
2006
ACM
15 years 4 months ago
2006
ACM
In this paper, we propose a technique to flexibly implement genetic algorithms for various problems on FPGAs. For the purpose, we propose a basic architecture for GA which consist...