76 search results - page 5 / 16 » Counting Solutions of Knapsack Constraints |
150
click to vote
SODA
2012
ACM
13 years 15 hour ago
2012
ACM
We give a constant factor approximation algorithm for the following generalization of the k-median problem. We are given a set of clients and facilities in a metric space. Each fa...
102
click to vote
SAT
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. A promising approach for model counting was recently introduced, which in theory requires the use of large random xor or parity constraints to obtain near-exact counts of...
AAAI
1997
14 years 11 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...
CPAIOR
2010
Springer
15 years 2 months ago
2010
Springer
We introduce an approach which combines ACO (Ant Colony Optimization) and IBM ILOG CP Optimizer for solving COPs (Combinatorial Optimization Problems). The problem is modeled using...
AAIM
2009
Springer
15 years 4 months ago
2009
Springer
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...