Sciweavers

860 search results - page 76 / 172
» Biased Random Walks
Sort
View
CDC
2008
IEEE
144views Control Systems» more  CDC 2008»
15 years 7 months ago
On the convergence time of distributed quantized averaging algorithms
— We come up with novel quantized averaging algorithms on synchronous and asynchronous communication networks with fixed, switching and random topologies. The implementation of ...
Minghui Zhu, Sonia Martínez
CP
2005
Springer
15 years 6 months ago
Bounds-Consistent Local Search
This paper describes a hybrid approach to solving large-scale constraint satisfaction and optimization problems. It describes a hybrid algorithm for integer linear programming whic...
Stefania Verachi, Steven David Prestwich
121
Voted
CVPR
2005
IEEE
16 years 2 months ago
Random Subspaces and Subsampling for 2-D Face Recognition
Random subspaces are a popular ensemble construction technique that improves the accuracy of weak classifiers. It has been shown, in different domains, that random subspaces combi...
Nitesh V. Chawla, Kevin W. Bowyer
97
Voted
PPSN
2000
Springer
15 years 4 months ago
Genetic Programming Bloat without Semantics
To investigate the fundamental causes of bloat, six artificial random binary tree search spaces are presented. Fitness is given by program syntax (the genetic programming genotype)...
William B. Langdon, Wolfgang Banzhaf
97
Voted
CORR
2006
Springer
101views Education» more  CORR 2006»
15 years 23 days ago
Geographic Gossip: Efficient Aggregation for Sensor Networks
Gossip algorithms for aggregation have recently received significant attention for sensor network applications because of their simplicity and robustness in noisy and uncertain en...
Alexandros G. Dimakis, Anand D. Sarwate, Martin J....