5153 search results - page 388 / 1031 » Introduction to Randomized Algorithms |
114
click to vote
ICDCS
1999
IEEE
15 years 9 months ago
1999
IEEE
In this paper we examine the problem of balancing load in a large-scale distributed system when information about server loads may be stale. It is well known that sending each req...
116
click to vote
GECCO
2000
Springer
15 years 8 months ago
2000
Springer
We present an "adaptive multi-start" genetic algorithm for the Euclidean traveling salesman problem that uses a population of tours locally optimized by the Lin-Kernigha...
150
Voted
CORR
2006
Springer
15 years 4 months ago
2006
Springer
Abstract. In combinatorics, the probabilistic method is a very powerful tool to prove the existence of combinatorial objects with interesting and useful properties. Explicit constr...
138
click to vote
COMBINATORICA
2007
15 years 4 months ago
2007
A complete partition of a graph G is a partition of its vertex set in which any two distinct classes are connected by an edge. Let cp(G) denote the maximum number of classes in a ...
180
click to vote
INFOCOM
2011
IEEE
14 years 8 months ago
2011
IEEE
—Recent advances in virtualization technology have made it a common practice to consolidate virtual machines(VMs) into a fewer number of servers. An efficient consolidation sche...