Sciweavers

1734 search results - page 82 / 347
» MSDR-D Network Localization Algorithm
Sort
View
APNOMS
2006
Springer
14 years 1 months ago
"P4L": A Four Layers P2P Model for Optimizing Resources Discovery and Localization
Peer-to-Peer systems are based on the concept of resources localization and mutualization in dynamic context. In specific environment such as mobile networks, characterized by high...
Mourad Amad, Ahmed Meddahi
DICS
2006
14 years 1 months ago
Algorithms for Failure Protection in Large IP-over-fiber and Wireless Ad Hoc Networks
We address failure location and restoration in both optical and wireless ad hoc networks. First, we show how Maximum Likelihood inference can improve failure location algorithms in...
Frederick Ducatelle, Luca Maria Gambardella, Macie...
IJAR
2008
167views more  IJAR 2008»
13 years 10 months ago
Approximate algorithms for credal networks with binary variables
This paper presents a family of algorithms for approximate inference in credal networks (that is, models based on directed acyclic graphs and set-valued probabilities) that contai...
Jaime Shinsuke Ide, Fabio Gagliardi Cozman
ML
2006
ACM
142views Machine Learning» more  ML 2006»
13 years 10 months ago
The max-min hill-climbing Bayesian network structure learning algorithm
We present a new algorithm for Bayesian network structure learning, called Max-Min Hill-Climbing (MMHC). The algorithm combines ideas from local learning, constraint-based, and sea...
Ioannis Tsamardinos, Laura E. Brown, Constantin F....
ICDCIT
2007
Springer
14 years 4 months ago
Self-stabilizing Routing Algorithms for Wireless Ad-Hoc Networks
This paper considers the problem of unicasting in wireless ad hoc networks. Unicasting is the problem of finding a route between a source and a destination and forwarding the mess...
Rohit Ashok Khot, Ravikant Poola, Kishore Kothapal...