1639 search results - page 123 / 328 » Anytime Heuristic Search |
AUSAI
2004
Springer
14 years 3 months ago
2004
Springer
In this paper we introduce an Ant Colony Optimisation (ACO) algorithm to find solutions for the well-known Knight’s Tour problem. The algorithm utilizes the implicit parallelism ...
ICCAD
1999
IEEE
14 years 2 months ago
1999
IEEE
This paper presents a new solution for combining technology mapping with placement, coupling the two into one phase. The original aspects of our work are the use of libraryless ma...
ACG
2009
Springer
14 years 2 months ago
2009
Springer
Abstract. Monte-Carlo tree search, especially the UCT algorithm and its enhancements, have become extremely popular. Because of the importance of this family of algorithms, a deepe...
HM
2007
Springer
14 years 2 months ago
2007
Springer
We present two hybrid Metaheuristics, a hybrid Iterated Local Search and a hybrid Simulated Annealing, for solving real-world extensions of the Vehicle Routing Problem with Time Wi...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
In this work, we present two new approaches based on variable neighborhood search (VNS) and ant colony optimization (ACO) for the reconstruction of cross cut shredded text documen...