Sciweavers

5922 search results - page 520 / 1185
» Navigability of Complex Networks
Sort
View
143
Voted
DEDS
2008
108views more  DEDS 2008»
15 years 6 months ago
An Algorithmic Toolbox for Network Calculus
Network calculus offers powerful tools to analyze the performances in communication networks, in particular to obtain deterministic bounds. This theory is based on a strong mathema...
Anne Bouillard, Eric Thierry
CORR
2006
Springer
85views Education» more  CORR 2006»
15 years 6 months ago
Discovering Network Topology in the Presence of Byzantine Faults
We pose and study the problem of Byzantine-robust topology discovery in an arbitrary asynchronous network. The problem straction of fault-tolerant routing. We formally state the we...
Mikhail Nesterenko, Sébastien Tixeuil
IJAR
2008
167views more  IJAR 2008»
15 years 6 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
CN
2007
106views more  CN 2007»
15 years 6 months ago
MIPv6 experimental evaluation using overlay networks
The commercial deployment of Mobile IPv6 has been hastened by the concepts of Integrated Wireless Networks and Overlay Networks, which are present in the notion of the forthcoming...
Pablo Vidales, Carlos Jesus Bernardos, Ignacio Sot...
CORR
2007
Springer
72views Education» more  CORR 2007»
15 years 6 months ago
WACA: A Hierarchical Weighted Clustering Algorithm optimized for Mobile Hybrid Networks
—Clustering techniques create hierarchal network structures, called clusters, on an otherwise flat network. In a dynamic environment—in terms of node mobility as well as in ter...
Matthias R. Brust, Adrian Andronache, Steffen Roth...