Sciweavers

94 search results - page 18 / 19
» An Algorithm for Multi-Unit Combinatorial Auctions
Sort
View
CPAIOR
2007
Springer
14 years 3 months ago
Best-First AND/OR Search for 0/1 Integer Programming
Abstract. AND/OR search spaces are a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is its sensitivity to the struc...
Radu Marinescu 0002, Rina Dechter
CPAIOR
2006
Springer
14 years 1 months ago
AND/OR Branch-and-Bound Search for Pure 0/1 Integer Linear Programming Problems
Abstract. AND/OR search spaces have recently been introduced as a unifying paradigm for advanced algorithmic schemes for graphical models. The main virtue of this representation is...
Radu Marinescu 0002, Rina Dechter
JSAT
2010
132views more  JSAT 2010»
13 years 4 months ago
The Impact of Max-SAT Resolution-Based Preprocessors on Local Search Solvers
In this paper we analyze three well-known preprocessors for Max-SAT. The first preprocessor is based on the so-called variable saturation. The second preprocessor is based on the ...
Federico Heras, David Bañeres
AAAI
2010
13 years 11 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
ATAL
2010
Springer
13 years 10 months ago
Automated negotiation with decommitment for dynamic resource allocation in cloud computing
We consider the problem of allocating networked resources in dynamic environment, such as cloud computing platforms, where providers strategically price resources to maximize thei...
Bo An, Victor R. Lesser, David Irwin, Michael Zink