Sciweavers

3147 search results - page 197 / 630
» Distributed averaging in dynamic networks
Sort
View
KDD
1998
ACM
112views Data Mining» more  KDD 1998»
15 years 10 months ago
Evaluating Usefulness for Dynamic Classification
This paper develops the concept of usefulness in the context of supervised learning. We argue that usefulness can be used to improve the performance of classification rules (as me...
Gholamreza Nakhaeizadeh, Charles Taylor, Carsten L...
ICC
2007
IEEE
139views Communications» more  ICC 2007»
16 years 25 days ago
Impatient Backoff Algorithm: Fairness in a Distributed Ad-Hoc MAC
— Many distributed multiple access (MAC) protocols use an exponential backoff mechanism. In that mechanism, a node picks a random backoff time uniformly in an interval that doubl...
Rajarshi Gupta, Jean C. Walrand
ICCS
2009
Springer
16 years 1 months ago
Improving the Scalability of SimGrid Using Dynamic Routing
Research into large-scale distributed systems often relies on the use of simulation frameworks in order to bypass the disadvantages of performing experiments on real testbeds. SimG...
Silas De Munck, Kurt Vanmechelen, Jan Broeckhove
ICC
2007
IEEE
124views Communications» more  ICC 2007»
16 years 25 days ago
Countermeasure Uncooperative Behaviors with Dynamic Trust-Token in VANETs
− As one special case of the Mobile Ad Hoc Networks (MANETs), Vehicular Ad hoc Network (VANET) is featured for its extremely high mobility and constantly changing topology. As a ...
Zhou Wang, Chunxiao Chigan
WCNC
2010
IEEE
15 years 10 months ago
Performance Bounds for AF Multi-Hop Relaying over Nakagami Fading
Abstract—This paper presents a new upper bound on the endto-end signal-to-noise ratio (SNR) of channel-assisted amplifyand-forward (AF) multi-hop relay networks. The harmonic mea...
Gayan Amarasuriya, Chintha Tellambura, Masoud Arda...