Sciweavers

721 search results - page 21 / 145
» GRASP - evolution for constraint satisfaction problems
Sort
View
ICTAI
2008
IEEE
15 years 4 months ago
Probabilistic Continuous Constraint Satisfaction Problems
Constraint programming has been used in many applications where uncertainty arises to model safe reasoning. The goal of constraint propagation is to propagate intervals of uncerta...
Elsa Carvalho, Jorge Cruz, Pedro Barahona
CONSTRAINTS
2010
126views more  CONSTRAINTS 2010»
14 years 9 months ago
Lexicographically-ordered constraint satisfaction problems
Abstract. We describe a simple CSP formalism for handling multi-attribute preference problems with hard constraints, one that combines hard constraints and preferences so the two a...
Eugene C. Freuder, Robert Heffernan, Richard J. Wa...
AAAI
2004
14 years 11 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
15 years 2 months 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
14 years 12 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