163 search results - page 31 / 33 » Approximate bidding algorithms for a distributed combinatori... |
PPSN
2000
Springer
13 years 9 months ago
2000
Springer
Abstract. We explore a new general-purpose heuristic for nding highquality solutions to hard optimization problems. The method, called extremal optimization, is inspired by self-or...
WISEC
2009
ACM
14 years 24 days ago
2009
ACM
Time synchronization in highly distributed wireless systems like sensor and ad hoc networks is extremely important in order to maintain a consistent notion of time throughout the ...
APPROX
2005
Springer
13 years 11 months ago
2005
Springer
A large class of stochastic optimization problems can be modeled as minimizing an objective function f that depends on a choice of a vector x ∈ X, as well as on a random external...
STOC
2010
ACM
13 years 11 months ago
2010
ACM
We study the classic mathematical economics problem of Bayesian optimal mechanism design where a principal aims to optimize expected revenue when allocating resources to self-inte...
FOCS
2009
IEEE
14 years 22 days ago
2009
IEEE
In this paper, we set forth a new algorithm for generating approximately uniformly random spanning trees in undirected graphs. We show how to sample from a distribution that is wi...