101 search results - page 19 / 21 » Solving Combinatorial Auctions Using Stochastic Local Search |
209
click to vote
NLP
2000
15 years 3 months ago
2000
Abstract. The purpose of this paper is (1) to provide a theoretical justification for the use of Monte-Carlo sampling for approximate resolution of NP-hard maximization problems in...
116
click to vote
MFCS
2009
Springer
15 years 4 months ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
115
click to vote
JMLR
2006
14 years 11 months ago
2006
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
101
click to vote
LCTRTS
1999
Springer
15 years 4 months ago
1999
Springer
We present a design tool for automated synthesis of embedded systems on distributed COTS-based platforms. Our synthesis tool consists of (1) a graphical user interface for input o...
111
click to vote
IAT
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--The Distributed Stochastic Algorithm (DSA), Distributed Breakout Algorithm (DBA), and variations such as Distributed Simulated Annealing (DSAN), MGM-1, and DisPeL, are di...