11 search results - page 2 / 3 » On the Sensitivity of Incremental Algorithms for Combinatori... |
SIGECOM
2003
ACM
14 years 20 days ago
2003
ACM
Combinatorial auctions, where bidders can submit bids on bundles of items, are economically efficient mechanisms for selling items to bidders, and are attractive when the bidders...
CP
2006
Springer
13 years 11 months ago
2006
Springer
Many important combinatorial optimization problems can be expressed as constraint satisfaction problems with soft constraints. When problems are too difficult to be solved exactly,...
AAAI
2010
13 years 9 months ago
2010
We consider the task of assigning experts from a portfolio of specialists in order to solve a set of tasks. We apply a Bayesian model which combines collaborative filtering with a...
CPAIOR
2007
Springer
14 years 1 months ago
2007
Springer
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...
CPAIOR
2006
Springer
13 years 11 months ago
2006
Springer
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...