24 search results - page 5 / 5 » Graph Abstraction in Real-time Heuristic Search |
GECCO
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper, we propose a hybrid genetic algorithm for partitioning a VLSI circuit graph into two disjoint graphs of minimum cut size. The algorithm includes a local op...
ANTSW
2004
Springer
13 years 9 months ago
2004
Springer
ed Abstract We present two heuristic mesh-partitioning methods, both of which build on the multiple ant-colony algorithm in order to improve the quality of the mesh partitions. The...
NLP
2000
13 years 8 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
CP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. Interleaved planning and scheduling employs the idea of extending partial plans by regularly heeding to the scheduling constraints during search. One of the techniques us...