Sciweavers

238 search results - page 19 / 48
» Efficient Methods for Selfish Network Design
Sort
View
HICSS
2009
IEEE
146views Biometrics» more  HICSS 2009»
14 years 2 months ago
A Dissemination Protocol to Guarantee Data Accessibility within N-Hops for Wireless Sensor Networks
One of the major challenges of designing a dissemination protocol for Wireless Sensor Networks (WSNs) is energy efficiency. Flooding and SPIN, which are very well-known proactive ...
Moonseong Kim, Matt W. Mutka, Sang-Hun Cho, Hyunse...
COMPUTER
2002
129views more  COMPUTER 2002»
13 years 7 months ago
Networks on Chips: A New SoC Paradigm
of abstraction and coarse granularity and distributed communication control. Focusing on using probabilistic metrics such as average values or variance to quantify design objective...
Luca Benini, Giovanni De Micheli
GECCO
2003
Springer
182views Optimization» more  GECCO 2003»
14 years 29 days ago
Spatial Operators for Evolving Dynamic Bayesian Networks from Spatio-temporal Data
Learning Bayesian networks from data has been studied extensively in the evolutionary algorithm communities [Larranaga96, Wong99]. We have previously explored extending some of the...
Allan Tucker, Xiaohui Liu, David Garway-Heath
P2P
2002
IEEE
124views Communications» more  P2P 2002»
14 years 20 days ago
The Multi-Ring Topology - High-Performance Group Communication in Peer-to-Peer Networks
Emerging peer-to-peer applications require efficient group communication. However, current techniques for group communication are not optimal for peer-to-peer networks, which do n...
Markus Junginger, Yugyung Lee
GECCO
2005
Springer
131views Optimization» more  GECCO 2005»
14 years 1 months ago
Statistical analysis of heuristics for evolving sorting networks
Designing efficient sorting networks has been a challenging combinatorial optimization problem since the early 1960’s. The application of evolutionary computing to this problem ...
Lee K. Graham, Hassan Masum, Franz Oppacher