1639 search results - page 63 / 328 » Anytime Heuristic Search |
90
Voted
IEAAIE
1998
Springer
15 years 4 months ago
1998
Springer
Abstract. Configuration is the process of composing a system from a set of components such that the system fulfills a set of desired demands. The configuration process relies on a ...
76
Voted
EOR
2006
15 years 16 days ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
105
Voted
TIT
1998
15 years 5 days ago
1998
Abstract— Many of the fundamental coding problems can be represented as graph problems. These problems are often intrinsically difficult and unsolved even if the code length is ...
134
Voted
CEC
2011
IEEE
14 years 15 days ago
2011
IEEE
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
127
click to vote
JAIR
2011
14 years 7 months ago
2011
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...