Sciweavers

721 search results - page 51 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
EVOW
2006
Springer
15 years 1 months ago
A Memetic Algorithm with Bucket Elimination for the Still Life Problem
Abstract. Bucket elimination (BE) is an exact technique based on variable elimination, commonly used for solving constraint satisfaction problems. We consider the hybridization of ...
José E. Gallardo, Carlos Cotta, Antonio J. ...
CP
1999
Springer
15 years 2 months ago
The Goldilocks Problem
A lot of work in constraint satisfaction has been focused on finding solutions to difficult problems. Many real life problems however, while not extremely complicated, have a huge...
Tudor Hulubei, Eugene C. Freuder
HAPTICS
2007
IEEE
15 years 4 months ago
Soft Finger Model with Adaptive Contact Geometry for Grasping and Manipulation Tasks
This paper presents a method for building analytical contact models for soft fingers. Friction constraints are derived based on general expressions for non-planar contacts of ela...
Matei T. Ciocarlie, Claire Lackner, Peter K. Allen
CP
2006
Springer
15 years 1 months ago
Randomization in Constraint Programming for Airline Planning
Abstract. We extend the common depth-first backtrack search for constraint satisfaction problems with randomized variable and value selection. The resulting methods are applied to ...
Lars Otten, Mattias Grönkvist, Devdatt P. Dub...
AIMSA
2008
Springer
14 years 11 months ago
DynABT: Dynamic Asynchronous Backtracking for Dynamic DisCSPs
Abstract. Constraint Satisfaction has been widely used to model static combinatorial problems. However, many AI problems are dynamic and take place in a distributed environment, i....
Bayo Omomowo, Inés Arana, Hatem Ahriz