Sciweavers

CP
2009
Springer
13 years 2 months ago
Minimizing the Maximum Number of Open Stacks by Customer Search
We describe a new exact solver for the minimization of open stacks problem (MOSP). By combining nogood recording with a branch and bound strategy based on choosing which customer s...
Geoffrey Chu, Peter J. Stuckey
AAAI
2004
13 years 6 months ago
GROWRANGE: Anytime VCG-Based Mechanisms
We introduce anytime mechanisms for distributed optimization with self-interested agents. Anytime mechanisms retain good incentive properties even when interrupted before the opti...
David C. Parkes, Grant Schoenebeck
AISC
2008
Springer
13 years 6 months ago
Strategies for Solving SAT in Grids by Randomized Search
Grid computing offers a promising approach to solving challenging computational problems in an environment consisting of a large number of easily accessible resources. In this pape...
Antti Eero Johannes Hyvärinen, Tommi A. Juntt...