2109 search results - page 107 / 422 » Solving Necklace Constraint Problems |
171
click to vote
ICDCS
2000
IEEE
15 years 9 months ago
2000
IEEE
We present resolvent-based learning as a new nogood learning method for a distributed constraint satisfaction algorithm. This method is based on a look-back technique in constrain...
128
Voted
ICTAI
2005
IEEE
15 years 10 months ago
2005
IEEE
Lotos is the ISO formal specification language for describing and verifying concurrent and distributed systems. The simulation or execution of complex Lotos specifications is, h...
130
Voted
COR
2006
15 years 5 months ago
2006
Constraint programming uses enumeration and search tree pruning to solve combinatorial optimization problems. In order to speed up this solution process, we investigate the use of...
124
click to vote
SAS
2007
Springer
15 years 11 months ago
2007
Springer
Type constraints express subtype-relationships between the types of program expressions that are required for type-correctness, and were originally proposed as a convenient framewo...
136
click to vote
CSUR
2000
15 years 4 months ago
2000
: Constraint satisfaction programming (CSP) is a powerful paradigm for solving complex combinatorial problems, which has gained a lot of attention recently. Putting the power of co...