955 search results - page 40 / 191 » A System for Solving Constraint Satisfaction Problems with S... |
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
Abstract The security of a network configuration is based not just on the security of its individual components and their direct interconnections, but also on the potential for sy...
CP
2003
Springer
14 years 1 months ago
2003
Springer
Abstract. The Quasigroup Completion Problem (QCP) is a very challenging benchmark among combinatorial problems, and the focus of much recent interest in the area of constraint prog...
AI
2005
Springer
13 years 7 months ago
2005
Springer
We present a new series of distributed constraint satisfaction algorithms, the distributed breakout algorithms, which is inspired by local search algorithms for solving the constr...
CP
2004
Springer
14 years 1 months ago
2004
Springer
Constraint programming is rapidly becoming the technology of choice for modeling and solving complex combinatorial problems. However, users of constraint programming technology nee...
ANOR
2007
13 years 8 months ago
2007
The profitability and morale of many organizations (such as factories, hospitals and airlines) are affected by their ability to schedule their personnel properly. Sophisticated an...