1378 search results - page 62 / 276 » The Tractability of Global Constraints |
171
click to vote
AI
2005
Springer
15 years 6 months ago
2005
Springer
The Distributed Constraint Optimization Problem (DCOP) is able to model a wide variety of distributed reasoning tasks that arise in multiagent systems. Unfortunately, existing met...
177
click to vote
CP
2004
Springer
15 years 10 months ago
2004
Springer
Many combinatorial (optimisation) problems have natural models based on, or including, set variables and set constraints. This was already known to the constraint programming commu...
150
click to vote
MFCS
2010
Springer
15 years 4 months ago
2010
Springer
For a finite set Γ of Boolean relations, Max Ones SAT(Γ) and Exact Ones SAT(Γ) are generalized satisfiability problems where every constraint relation is from Γ, and the task...
161
click to vote
ACL
2009
15 years 4 months ago
2009
Variational EM has become a popular technique in probabilistic NLP with hidden variables. Commonly, for computational tractability, we make strong independence assumptions, such a...
150
click to vote
CONSTRAINTS
2007
15 years 6 months ago
2007
When a new (global) constraint is introduced in local search, measures for the penalty and variable conflicts of that constraint must be defined, and incremental algorithms for m...