1257 search results - page 9 / 252 » Near-Optimal Scheduling of Distributed Algorithms |
119
click to vote
SOFSEM
2010
Springer
15 years 10 months ago
2010
Springer
Regret minimization has proven to be a very powerful tool in both computational learning theory and online algorithms. Regret minimization algorithms can guarantee, for a single de...
141
click to vote
IPPS
2007
IEEE
15 years 7 months ago
2007
IEEE
Particle Swarm Optimization (PSO) is a population-based stochastic optimization technique, which can be used to find an optimal, or near optimal, solution to a numerical and quali...
101
click to vote
RANDOM
1999
Springer
15 years 5 months ago
1999
Springer
We investigate an online version of a basic scheduling problem where a set of jobs has to be scheduled on a number of identical machines so as to minimize the makespan. The job pr...
104
click to vote
SPAA
2005
ACM
15 years 7 months ago
2005
ACM
We study oblivious routing in which the packet paths are constructed independently of each other. We give a simple oblivious routing algorithm for geometric networks in which the ...
100
click to vote
DC
2010
15 years 1 months ago
2010
We present efficient algorithms for computing very sparse low distortion spanners in distributed networks and prove some non-trivial lower bounds on the tradeoff between time, spar...