Sciweavers

1026 search results - page 181 / 206
» An Optimal Solution to Room Search Problem
Sort
View
EVOW
2006
Springer
13 years 11 months ago
Divide-and-Evolve: A New Memetic Scheme for Domain-Independent Temporal Planning
An original approach, termed Divide-and-Evolve is proposed to hybridize Evolutionary Algorithms (EAs) with Operational Research (OR) methods in the domain of Temporal Planning Prob...
Marc Schoenauer, Pierre Savéant, Vincent Vi...
FLAIRS
2008
13 years 9 months ago
Conditional and Composite Constraints with Preferences
Preferences in constraint problems are common but significant in many real world applications. In this paper, we extend our conditional and composite CSP (CCCSP) framework, managi...
Malek Mouhoub, Amrudee Sukpan
CCCG
2004
13 years 8 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
IVC
2007
114views more  IVC 2007»
13 years 7 months ago
Evaluation of a convex relaxation to a quadratic assignment matching approach for relational object views
We introduce a convex relaxation approach for the quadratic assignment problem to the field of computer vision. Due to convexity, a favourable property of this approach is the ab...
Christian Schellewald, Stefan Roth, Christoph Schn...
GECCO
2008
Springer
186views Optimization» more  GECCO 2008»
13 years 8 months ago
A pareto following variation operator for fast-converging multiobjective evolutionary algorithms
One of the major difficulties when applying Multiobjective Evolutionary Algorithms (MOEA) to real world problems is the large number of objective function evaluations. Approximate...
A. K. M. Khaled Ahsan Talukder, Michael Kirley, Ra...