376 search results - page 2 / 76 » Solution Counting Algorithms for Constraint-Centered Search ... |
AAAI
1997
13 years 9 months ago
1997
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
EOR
2010
13 years 5 months ago
2010
We consider the bicriteria scheduling problem of minimizing the number of tardy jobs and average flowtime on a single machine. This problem, which is known to be NP-hard, is impor...
CORR
2007
Springer
13 years 7 months ago
2007
Springer
Abstract. We describe decomposition during search (DDS), an integration of And/Or tree search into propagation-based constraint solvers. The presented search algorithm dynamically ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Distributed Constraint Optimization (DCOP) is a key technique for solving multiagent coordination problems. Unfortunately, finding minimal-cost DCOP solutions is NP-hard. We there...
INFORMS
2010
13 years 6 months ago
2010
We develop a solution approach for the fixed charge network flow problem (FCNF) that produces provably high-quality solutions quickly. The solution approach combines mathematica...