Sciweavers

6251 search results - page 93 / 1251
» Randomness, Computability, and Density
Sort
View
IPPS
2009
IEEE
14 years 4 months ago
Robust sequential resource allocation in heterogeneous distributed systems with random compute node failures
—The problem of finding efficient workload distribution techniques is becoming increasingly important today for heterogeneous distributed systems where the availability of comp...
Vladimir Shestak, Edwin K. P. Chong, Anthony A. Ma...
GECCO
2008
Springer
156views Optimization» more  GECCO 2008»
13 years 11 months ago
Computing minimum cuts by randomized search heuristics
We study the minimum s-t-cut problem in graphs with costs on the edges in the context of evolutionary algorithms. Minimum cut problems belong to the class of basic network optimiz...
Frank Neumann, Joachim Reichel, Martin Skutella
COCO
2005
Springer
89views Algorithms» more  COCO 2005»
14 years 3 months ago
Computationally Private Randomizing Polynomials and Their Applications
Benny Applebaum, Yuval Ishai, Eyal Kushilevitz