Sciweavers

1951 search results - page 345 / 391
» An algorithm for improving graph partitions
Sort
View
TSP
2010
14 years 10 months ago
Optimization and analysis of distributed averaging with short node memory
Distributed averaging describes a class of network algorithms for the decentralized computation of aggregate statistics. Initially, each node has a scalar data value, and the goal...
Boris N. Oreshkin, Mark Coates, Michael G. Rabbat
GECCO
2009
Springer
199views Optimization» more  GECCO 2009»
15 years 8 months ago
Using behavioral exploration objectives to solve deceptive problems in neuro-evolution
Encouraging exploration, typically by preserving the diversity within the population, is one of the most common method to improve the behavior of evolutionary algorithms with dece...
Jean-Baptiste Mouret, Stéphane Doncieux
CVPR
2007
IEEE
16 years 6 months ago
ShadowCuts: Photometric Stereo with Shadows
We present an algorithm for performing Lambertian photometric stereo in the presence of shadows. The algorithm has three novel features. First, a fast graph cuts based method is u...
Manmohan Krishna Chandraker, Sameer Agarwal, David...
FOCS
2008
IEEE
15 years 10 months ago
Clock Synchronization with Bounded Global and Local Skew
We present a distributed clock synchronization algorithm that guarantees an exponentially improved bound of O(log D) on the clock skew between neighboring nodes in any graph G of ...
Christoph Lenzen, Thomas Locher, Roger Wattenhofer
ICRA
2006
IEEE
120views Robotics» more  ICRA 2006»
15 years 10 months ago
Distributed Diagnosis of Coupled Mobile Robots
— Fault diagnosis of coupled mobile robots requires a large number of measurements to be communicated either between the robots or from the robots to a central diagnoser. As comp...
Matthew J. Daigle, Xenofon D. Koutsoukos, Gautam B...