Sciweavers

155 search results - page 17 / 31
» A Conflict Tabu Search Evolutionary Algorithm for Solving Co...
Sort
View
IJCAI
2003
13 years 9 months ago
Making the Breakout Algorithm Complete Using Systematic Search
Local search algorithms have been very successful for solving constraint satisfaction problems (CSP). However, a major weakness has been that local search is unable to detect unso...
Carlos Eisenberg, Boi Faltings
EOR
2006
135views more  EOR 2006»
13 years 7 months ago
Principles of scatter search
Scatter search is an evolutionary method that has been successfully applied to hard optimization problems. The fundamental concepts and principles of the method were first propose...
Rafael Martí, Manuel Laguna, Fred Glover
CDB
2004
Springer
143views Database» more  CDB 2004»
14 years 28 days ago
Constraint Processing Techniques for Improving Join Computation: A Proof of Concept
Constraint Processing and Database techniques overlap significantly. We discuss here the application of a constraint satisfaction technique, called dynamic bundling, to databases....
Anagh Lal, Berthe Y. Choueiry
IJCAI
2001
13 years 9 months ago
Backtracking Through Biconnected Components of a Constraint Graph
The algorithm presented here, BCC, is an enhancement of the well known Backtrack used to solve constraint satisfaction problems. Though most backtrack improvements rely on propaga...
Jean-François Baget, Yannic S. Tognetti
CEC
2007
IEEE
13 years 11 months ago
Three-dimensional offline path planning for UAVs using multiobjective evolutionary algorithms
In this paper, we present 3D offline path planner for Unmanned Aerial Vehicles (UAVs) using Multiobjective Evolutionary Algorithms for finding solutions corresponding to conflictin...
Shashi Mittal, Kalyanmoy Deb