Sciweavers

5911 search results - page 452 / 1183
» Annealing Sensor Networks
Sort
View
ICIP
2010
IEEE
15 years 4 months ago
Distributed classification of multiple observations by consensus
We consider the problem of distributed classification of multiple observations of the same object that are collected in an ad-hoc network of vision sensors. Assuming that each sen...
Effrosini Kokiopoulou, Pascal Frossard
TMC
2008
91views more  TMC 2008»
15 years 6 months ago
Dynamic Forwarding over Tree-on-DAG for Scalable Data Aggregation in Sensor Networks
Computing and maintaining network structures for efficient data aggregation incurs high overhead for dynamic events where the set of nodes sensing an event changes with time. Moreo...
Kai-Wei Fan, Sha Liu, Prasun Sinha
209
Voted
GECCO
2010
Springer
207views Optimization» more  GECCO 2010»
15 years 11 months ago
Generalized crowding for genetic algorithms
Crowding is a technique used in genetic algorithms to preserve diversity in the population and to prevent premature convergence to local optima. It consists of pairing each offsp...
Severino F. Galán, Ole J. Mengshoel
178
Voted
ASPDAC
2000
ACM
154views Hardware» more  ASPDAC 2000»
15 years 11 months ago
Dynamic weighting Monte Carlo for constrained floorplan designs in mixed signal application
Simulated annealing has been one of the most popular stochastic optimization methods used in the VLSI CAD field in the past two decades for handling NP-hard optimization problems...
Jason Cong, Tianming Kong, Faming Liang, Jun S. Li...
ICASSP
2011
IEEE
14 years 10 months ago
Reaching consensus in asynchronous WSNs: Algebraic approach
Many models of wireless sensor networks (WSNs) assume a perfect synchronization along the graph of such network as a simplifying assumption. In our contribution we base our invest...
Ondrej Sluciak, Markus Rupp