Sciweavers

306 search results - page 28 / 62
» Parallel approximation algorithms for facility-location prob...
Sort
View
SODA
2008
ACM
86views Algorithms» more  SODA 2008»
15 years 5 months ago
Parallel monotonicity reconstruction
We investigate the problem of monotonicity reconstruction, as defined in [3], in a parallel setting. We have oracle access to a nonnegative real-valued function f defined on domai...
Michael E. Saks, C. Seshadhri
171
Voted
PODC
2010
ACM
15 years 7 months ago
Distributed algorithms for edge dominating sets
An edge dominating set for a graph G is a set D of edges such that each edge of G is in D or adjacent to at least one edge in D. This work studies deterministic distributed approx...
Jukka Suomela
PPSN
2004
Springer
15 years 9 months ago
LS-CMA-ES: A Second-Order Algorithm for Covariance Matrix Adaptation
Abstract. Evolution Strategies, Evolutionary Algorithms based on Gaussian mutation and deterministic selection, are today considered the best choice as far as parameter optimizatio...
Anne Auger, Marc Schoenauer, Nicolas Vanhaecke
WSC
2008
15 years 6 months ago
Dynamic entity distribution in parallel discrete event simulation
Event based simulations are an important scientific application in many fields. With the rise of cluster computing, distributed event simulation optimization becomes an essential ...
Michael Slavik, Imad Mahgoub, Ahmed Badi
131
Voted
IPL
2002
90views more  IPL 2002»
15 years 3 months ago
On the approximability of two tree drawing conventions
We consider two aesthetic criteria for the visualization of rooted trees: inclusion and tip-over. Finding the minimum area layout according to either of these two standards is an ...
Paolo Penna