26 search results - page 4 / 6 » Local Symmetry Breaking During Search in CSPs |
SPIN
2009
Springer
15 years 4 months ago
2009
Springer
While symmetry reduction has been established to be an important technique for reducing the search space in model checking, its application in concurrent software verification is ...
IJCAI
2007
14 years 11 months ago
2007
Constraint Satisfaction Problems (CSPs) are ubiquitous in Artificial Intelligence. The backtrack algorithms that maintain some local consistency during search have become the de ...
FLAIRS
2004
14 years 11 months ago
2004
The distributed constraint satisfaction problem (CSP) is a general formalization used to represent problems in distributed multi-agent systems. To deal with realistic problems, mu...
139
click to vote
PODC
2011
ACM
14 years 12 days ago
2011
ACM
A maximal independent set on a graph is an inclusion-maximal set of mutually non-adjacent nodes. This basic symmetry breaking structure is vital for many distributed algorithms, w...
91
Voted
CONSTRAINTS
2011
14 years 4 months ago
2011
The Steel Mill Slab Problem is an optimization benchmark that has been studied for a long time in the constraint-programming community but was only solved efficiently in the two l...