Sciweavers

2466 search results - page 140 / 494
» Algorithms for distributed functional monitoring
Sort
View
SODA
2012
ACM
245views Algorithms» more  SODA 2012»
13 years 5 months ago
Lower bounds for number-in-hand multiparty communication complexity, made easy
In this paper we prove lower bounds on randomized multiparty communication complexity, both in the blackboard model (where each message is written on a blackboard for all players ...
Jeff M. Phillips, Elad Verbin, Qin Zhang
ACCV
2010
Springer
14 years 9 months ago
Towards Full 3D Helmholtz Stereovision Algorithms
Helmholtz stereovision methods are limited to binocular stereovision or depth maps reconstruction. In this paper, we extend these methods to recover the full 3D shape of the object...
Amaël Delaunoy, Emmanuel Prados, Peter N. Bel...
125
Voted
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
15 years 8 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
112
Voted
EVOW
2009
Springer
15 years 9 months ago
On the Parallel Speed-Up of Estimation of Multivariate Normal Algorithm and Evolution Strategies
Motivated by parallel optimization, we experiment EDA-like adaptation-rules in the case of λ large. The rule we use, essentially based on estimation of multivariate normal algorit...
Fabien Teytaud, Olivier Teytaud
107
Voted
PE
2000
Springer
101views Optimization» more  PE 2000»
15 years 2 months ago
On the convergence of the power series algorithm
In this paper we study the convergence properties of the power series algorithm, which is a general method to determine (functions of) stationary distributions of Markov chains. W...
Gerard Hooghiemstra, Ger Koole