Sciweavers

101 search results - page 3 / 21
» Solving Combinatorial Auctions Using Stochastic Local Search
Sort
View
JSAT
2010
132views more  JSAT 2010»
13 years 5 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
WECWIS
2002
IEEE
129views ECommerce» more  WECWIS 2002»
14 years 3 months ago
On the Sensitivity of Incremental Algorithms for Combinatorial Auctions
Despite the large amounts of runtime needed to adequately solve a combinatorial auction (CA), existing iterative CA auction protocols require winner determination during every rou...
Ryan Kastner, Christina Hsieh, Miodrag Potkonjak, ...
IJCAI
2001
14 years 9 days ago
Solving Non-Boolean Satisfiability Problems with Stochastic Local Search
Much excitement has been generated by the success of stochastic local search procedures at finding solutions to large, very hard satisfiability problems. Many of the problems on wh...
Alan M. Frisch, Timothy J. Peugniez
JAR
2000
123views more  JAR 2000»
13 years 10 months ago
Local Search Algorithms for SAT: An Empirical Evaluation
Local search algorithms are among the standard methods for solving hard combinatorial problems from various areas of Artificial Intelligence and Operations Research. For SAT, some ...
Holger H. Hoos, Thomas Stützle
HICSS
2005
IEEE
134views Biometrics» more  HICSS 2005»
14 years 4 months ago
A Non-Exact Approach and Experiment Studies on the Combinatorial Auction Problem
In this paper we formulate a combinatorial auction brokering problem as a set packing problem and apply a simulated annealing heuristic with hybrid local moves to solve the proble...
Yunsong Guo, Andrew Lim, Brian Rodrigues, Yi Zhu