Sciweavers

227 search results - page 43 / 46
» Combinatorial Auctions with Budgets
Sort
View
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
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 11 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
ECRA
2010
145views more  ECRA 2010»
13 years 9 months ago
Inferring preference correlations from social networks
Identifying consumer preferences is a key challenge in customizing electronic commerce sites to individual users. The increasing availability of online social networks provides on...
Tad Hogg
EAAI
2008
75views more  EAAI 2008»
13 years 9 months ago
Enacting agent-based services for automated procurement
Negotiation events in industrial procurement involving multiple, highly customisable goods pose serious challenges to buying agents when trying to determine the best set of provid...
Andrea Giovannucci, Juan A. Rodríguez-Aguil...