Sciweavers

942 search results - page 22 / 189
» Distance Constraint Satisfaction Problems
Sort
View
AAAI
2004
13 years 9 months ago
Domain Transmutation in Constraint Satisfaction Problems
We study local interchangeability of values in constraint networks based on a new approach where a single value in the domain of a variable can be treated as a combination of &quo...
James Bowen, Chavalit Likitvivatanavong
AI
2001
Springer
14 years 29 days ago
Search Techniques for Non-linear Constraint Satisfaction Problems with Inequalities
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...
Marius-Calin Silaghi, Djamila Sam-Haroud, Boi Falt...
AIPS
2007
13 years 10 months ago
Temporally-Expressive Planning as Constraint Satisfaction Problems
Due to its important practical applications, temporal planning is of great research interest in artificial intelligence. Yet most of the work in this area so far is limited in at...
Yuxiao Hu
CPAIOR
2006
Springer
14 years 5 days ago
Conditional Lexicographic Orders in Constraint Satisfaction Problems
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
Richard J. Wallace, Nic Wilson
CEC
2005
IEEE
14 years 2 months ago
Hybrid evolutionary algorithms for constraint satisfaction problems: memetic overkill?
We study a selected group of hybrid EAs for solving CSPs, consisting of the best performing EAs from the literature. We investigate the contribution of the evolutionary component t...
Bart G. W. Craenen, A. E. Eiben