419 search results - page 80 / 84 » An LP-Designed Algorithm for Constraint Satisfaction |
SODA
2010
ACM
13 years 5 months ago
2010
ACM
We present an exact algorithm that decides, for every fixed r ≥ 2 in time O(m) + 2O(k2 ) whether a given multiset of m clauses of size r admits a truth assignment that satisfi...
SIGSOFT
2007
ACM
14 years 8 months ago
2007
ACM
Atomicity is a desirable property that safeguards application consistency for service compositions. A service composition exhibiting this property could either complete or cancel ...
SAT
2005
Springer
14 years 25 days ago
2005
Springer
Much attention has been given in recent years to the problem of finding Minimally Unsatisfiable Subformulas (MUSes) of Boolean formulas. In this paper, we present a new view of the...
ATAL
2006
Springer
13 years 11 months ago
2006
Springer
Distributed Constraint Satisfaction Problems (DCSPs) provide a model to capture a broad range of cooperative multiagent problem solving settings. Researchers have generally propos...
DATE
2004
IEEE
13 years 11 months ago
2004
IEEE
Code optimization and high level synthesis can be posed as constraint satisfaction and optimization problems, such as graph coloring used in register allocation. Graph coloring is...