376 search results - page 37 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The resolution of a Multi-Objective Optimization Problem (MOOP) does not end when the Pareto-optimal set is found. In real problems, a single solution must be selected. Ideally, t...
KI
2006
Springer
14 years 9 months ago
2006
Springer
Abstract. In this paper, a framework for previous and new quasi-exact extensions of the A -algorithm is presented. In contrast to previous approaches, the new methods guarantee to ...
IJCAI
2003
14 years 11 months ago
2003
Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
GECCO
2004
Springer
15 years 3 months ago
2004
Springer
Estimation of distribution algorithms (EDAs) are population-based heuristic search methods that use probabilistic models of good solutions to guide their search. When applied to co...
GECCO
2005
Springer
15 years 3 months ago
2005
Springer
We focus on the handling of overlapping solutions in evolutionary multiobjective optimization (EMO) algorithms. First we show that there exist a large number of overlapping soluti...