3047 search results - page 247 / 610 » Randomized Parallel Selection |
AAAI
2007
15 years 1 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...
101
click to vote
ESEM
2008
ACM
15 years 1 months ago
2008
ACM
Pair programming is a practice in which two programmers work collaboratively at one computer on the same design, algorithm, or code. Prior research on pair programming has primari...
NIPS
2008
15 years 21 days ago
2008
We consider multi-armed bandit problems where the number of arms is larger than the possible number of experiments. We make a stochastic assumption on the mean-reward of a new sel...
ESM
2000
15 years 19 days ago
2000
The framework of this paper is the design of complex communication protocols by simulation, based on formal description techniques (FDT). We propose a general-purpose scalable mod...
117
click to vote
HICSS
2008
IEEE
14 years 11 months ago
2008
IEEE
Selecting a small set of nodes called pivots, from all the nodes in a network and maintaining the routing infrastructure to and among each other can reduce routing overhead and ex...