4524 search results - page 185 / 905 » The Complexity of Global Constraints |
230
click to vote
FOCS
2002
IEEE
15 years 11 months ago
2002
IEEE
The Constraint Satisfaction Problem (CSP) provides a common framework for many combinatorial problems. The general CSP is known to be NP-complete; however, certain restrictions on...
173
click to vote
CP
1999
Springer
15 years 11 months ago
1999
Springer
Reformulating constraint satisfaction problems (CSPs) in lower arity is a common procedure when computing consistency. Lower arity CSPs are simpler to treat than high arity CSPs. ...
181
Voted
WECWIS
2006
IEEE
16 years 18 days ago
2006
IEEE
UN/CEFACT’s modeling methodology (UMM) is used to develop global choreographies of inter-organizational business processes. UMM models should be publically available in order to...
187
click to vote
FOCS
1999
IEEE
15 years 11 months ago
1999
IEEE
We present a simple probabilistic algorithm for solving kSAT, and more generally, for solving constraint satisfaction problems (CSP). The algorithm follows a simple localsearch pa...
166
click to vote
AAAI
2008
15 years 9 months ago
2008
Probabilistic modeling has been a dominant approach in Machine Learning research. As the field evolves, the problems of interest become increasingly challenging and complex. Makin...