Sciweavers

714 search results - page 93 / 143
» Lexicographically-ordered constraint satisfaction problems
Sort
View
CONEXT
2010
ACM
13 years 8 months ago
NEVERMIND, the problem is already fixed: proactively detecting and troubleshooting customer DSL problems
Traditional DSL troubleshooting solutions are reactive, relying mainly on customers to report problems, and tend to be labor-intensive, time consuming, prone to incorrect resoluti...
Yu Jin, Nick G. Duffield, Alexandre Gerber, Patric...
COMPULOG
1999
Springer
14 years 2 months ago
Decomposable Constraints
Many constraint satisfaction problems can be naturally and efficiently modelled using non-binary constraints like the “all-different” and “global cardinality” constraints...
Ian P. Gent, Kostas Stergiou, Toby Walsh
HEURISTICS
2002
152views more  HEURISTICS 2002»
13 years 9 months ago
A Constraint-Based Method for Project Scheduling with Time Windows
This paper presents a heuristic algorithm for solving RCPSP/max, the resource constrained project scheduling problem with generalized precedence relations. The algorithm relies, a...
Amedeo Cesta, Angelo Oddi, Stephen F. Smith
CP
2003
Springer
14 years 3 months ago
Comparison of Symmetry Breaking Methods
Symmetry in a Constraint Satisfaction Problem can cause wasted search, which can be avoided by adding constraints to the CSP to exclude symmetric assignments or by modifying the s...
Karen E. Petrie
SAC
1994
ACM
14 years 2 months ago
Extending a parallel CLP language to support the development of multi-agent systems
An extension of Me parallel constraint logic programming language ElipSys is presented. This extension is directed towards the development of multi-agent systems which have to dea...
Panagiotis Stamatopoulos, Dimitris Margaritis, Con...