Sciweavers

6506 search results - page 454 / 1302
» Algorithmic models for sensor networks
Sort
View
TON
2008
109views more  TON 2008»
15 years 6 months ago
Efficient routing in intermittently connected mobile networks: the single-copy case
Abstract--Intermittently connected mobile networks are wireless networks where most of the time there does not exist a complete path from the source to the destination. There are m...
Thrasyvoulos Spyropoulos, Konstantinos Psounis, Ca...
ADHOCNOW
2009
Springer
15 years 4 months ago
A Decentralized Approach to Minimum-Energy Broadcasting in Static Ad Hoc Networks
Broadcasting is a commonly used feature in wireless networking, e.g. for file distribution, re-tasking, event notification, or miscellaneous maintenance. Due to the limited resourc...
Christopher Miller, Christian Poellabauer
IWINAC
2007
Springer
16 years 29 days ago
EDNA: Estimation of Dependency Networks Algorithm
One of the key points in Estimation of Distribution Algorithms (EDAs) is the learning of the probabilistic graphical model used to guide the search: the richer the model the more ...
José A. Gámez, Juan L. Mateo, Jose M...
JETAI
1998
110views more  JETAI 1998»
15 years 6 months ago
Independency relationships and learning algorithms for singly connected networks
Graphical structures such as Bayesian networks or Markov networks are very useful tools for representing irrelevance or independency relationships, and they may be used to e cientl...
Luis M. de Campos
PERCOM
2007
ACM
16 years 6 months ago
A Simple Model and Infrastructure for Context-Aware Browsing of the World
The imminent mass deployment of pervasive computing technologies such as sensor networks and RFID tags, together with the increasing participation of the Web community in feeding ...
Gabriella Castelli, Alberto Rosi, Marco Mamei, Fra...