Sciweavers

3 search results - page 1 / 1
» A Faster Core Constraint Generation Algorithm for Combinator...
Sort
View
AAIM
2009
Springer
123views Algorithms» more  AAIM 2009»
14 years 7 days ago
Efficiently Generating k-Best Solutions to Procurement Auctions
: © Efficiently Generating k-Best Solutions to Procurement Auctions Andrew Byde, Terence Kelly, Yunhong Zhou, Robert Tarjan HP Laboratories HPL-2009-163 procurement, auctions, dec...
Andrew Byde, Terence Kelly, Yunhong Zhou, Robert E...
AAAI
2010
13 years 7 months ago
Efficient Belief Propagation for Utility Maximization and Repeated Inference
Many problems require repeated inference on probabilistic graphical models, with different values for evidence variables or other changes. Examples of such problems include utilit...
Aniruddh Nath, Pedro Domingos
PPDP
2010
Springer
13 years 4 months ago
A declarative approach to robust weighted Max-SAT
The presence of uncertainty in the real world makes robustness to be a desired property of solutions to constraint satisfaction problems. Roughly speaking, a solution is robust if...
Miquel Bofill, Dídac Busquets, Mateu Villar...