2109 search results - page 159 / 422 » Solving Necklace Constraint Problems |
153
click to vote
SARA
2007
Springer
16 years 8 days ago
2007
Springer
Abstract. In constraint satisfaction, local search is an incomplete method for finding a solution to a problem. Solving a general constraint satisfaction problem (CSP) is known to...
141
click to vote
CC
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enum...
151
click to vote
ATAL
2010
Springer
15 years 7 months ago
2010
Springer
We present a fully distributed multi-agent planning algorithm. Our methodology uses distributed constraint satisfaction to coordinate between agents, and local planning to ensure ...
142
click to vote
AUTOMATICA
2007
15 years 6 months ago
2007
This paper extends some duality results from a standard optimization setup to a noncooperative (Nash) game framework. A Nash game (NG) with coupled constraints is considered. Solv...
208
click to vote
JMLR
2010
15 years 28 days ago
2010
We propose to solve the combinatorial problem of finding the highest scoring Bayesian network structure from data. This structure learning problem can be viewed as an inference pr...