17 search results - page 1 / 4 » Optimal Parallelization of Las Vegas Algorithms |
PC
2011
13 years 6 days ago
2011
This paper addresses the problem of minimizing the average running time of the Las Vegas type algorithm, both in serial and parallel setups. The necessary conditions for the exist...
STACS
1994
Springer
13 years 9 months ago
1994
Springer
AAAI
2007
13 years 7 months ago
2007
The mean running time of a Las Vegas algorithm can often be dramatically reduced by periodically restarting it with a fresh random seed. The optimal restart schedule depends on th...
CEC
2011
IEEE
12 years 5 months ago
2011
IEEE
—We develop a stochastic local search algorithm for finding Pareto points for multi-criteria optimization problems. The algorithm alternates between different single-criterium o...
SPAA
2005
ACM
13 years 10 months ago
2005
ACM
Switching cells in parallel is a common approach to build switches with very high external line rate and a large number of ports. A prime example is the parallel packet switch (in...