1300 search results - page 31 / 260 » Constraint satisfaction problems and global cardinality cons... |
102
click to vote
AI
2001
Springer
15 years 2 months ago
2001
Springer
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...
CPAIOR
2006
Springer
15 years 1 months ago
2006
Springer
The lexicographically-ordered CSP ("lexicographic CSP" for short) combines a simple representation of preferences with the feasibility constraints of ordinary CSPs. Prefe...
AIPS
2007
15 years 42 min ago
2007
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...
CEC
2005
IEEE
15 years 3 months ago
2005
IEEE
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...
IJCAI
2003
14 years 11 months ago
2003
We investigate interchangeability of values in CSPs, based on an approach where a single value in the domain of a variable can be treated as a combination of “sub-values”. An ...