416 search results - page 48 / 84 » Approximation Algorithms for Reliable Stochastic Combinatori... |
JCSS
2008
13 years 8 months ago
2008
We use techniques from sample-complexity in machine learning to reduce problems of incentive-compatible mechanism design to standard algorithmic questions, for a broad class of re...
SODA
2012
ACM
11 years 11 months ago
2012
ACM
The following distributed coalescence protocol was introduced by Dahlia Malkhi in 2006 motivated by applications in social networking. Initially there are n agents wishing to coal...
PPSN
2000
Springer
14 years 8 days 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...
CEC
2008
IEEE
14 years 3 months ago
2008
IEEE
—Ant Colony Optimization (ACO) algorithm is a novel meta-heuristic algorithm for the approximate solution of combinatorial optimization problems that has been inspired by the for...
PE
2006
Springer
13 years 8 months ago
2006
Springer
Approximating general distributions by phase-type (PH) distributions is a popular technique in stochastic analysis, since the Markovian property of PH distributions often allows a...