Sciweavers

188 search results - page 11 / 38
» A comparative analysis of dynamic network decoding
Sort
View
MOBIHOC
2002
ACM
14 years 8 months ago
Performance analysis of the CONFIDANT protocol
: Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate...
Sonja Buchegger, Jean-Yves Le Boudec
GECCO
2007
Springer
162views Optimization» more  GECCO 2007»
14 years 2 months ago
Using pair approximations to predict takeover dynamics in spatially structured populations
The topological properties of a network directly impact the flow of information through a system. For example, in natural populations, the network of inter-individual contacts aff...
Joshua L. Payne, Margaret J. Eppstein
CIMCA
2005
IEEE
14 years 2 months ago
An Accelerating Learning Algorithm for Block-Diagonal Recurrent Neural Networks
An efficient training method for block-diagonal recurrent neural networks is proposed. The method modifies the RPROP algorithm, originally developed for static models, in order to...
Paris A. Mastorocostas, Dimitris N. Varsamis, Cons...
ICUMT
2009
13 years 6 months ago
Towards real implementations of dynamic robust routing exploiting path diversity
In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
Luca Muscariello, Diego Perino, Bruno Nardelli
IPSN
2005
Springer
14 years 1 months ago
Robust computation of aggregates in wireless sensor networks: distributed randomized algorithms and analysis
A wireless sensor network consists of a large number of small, resource-constrained devices and usually operates in hostile environments that are prone to link and node failures. ...
Jen-Yeu Chen, Gopal Pandurangan, Dongyan Xu