158 search results - page 13 / 32 » Solving Sequential Mixed Auctions with Integer Programming |
ICCV
2009
IEEE
13 years 5 months ago
2009
IEEE
Finding the largest consensus set is one of the key ideas used by the original RANSAC for removing outliers in robust-estimation. However, because of its random and non-determinis...
CPAIOR
2010
Springer
13 years 5 months ago
2010
Springer
Finite domain propagation solving, the basis of constraint programming (CP) solvers, allows building very high-level models of problems, and using highly specific inference encapsu...
AMAI
2004
Springer
14 years 1 months ago
2004
Springer
In this paper we formulate the combinatorial auction brokering problem as a Set Packing Problem (SPP) and apply a simulated annealing heuristic to solve SPP. Experimental results ...
JAIR
2010
13 years 6 months ago
2010
Decentralized planning in uncertain environments is a complex task generally dealt with by using a decision-theoretic approach, mainly through the framework of Decentralized Parti...
4OR
2010
13 years 6 months ago
2010
This a summary of the author's PhD thesis supervised by Leo Liberti, Philippe Baptiste and Daniel Krob and defended on 18 June 2009 at Ecole Polytechnique, Palaiseau, France. ...