Sciweavers

1511 search results - page 230 / 303
» Randomness, lowness and degrees
Sort
View
INFOCOM
2009
IEEE
16 years 25 days ago
Scalable Routing Via Greedy Embedding
Abstract—We investigate the construction of greedy embeddings in polylogarithmic dimensional Euclidian spaces in order to achieve scalable routing through geographic routing. We ...
Cédric Westphal, Guanhong Pei
INFOCOM
2009
IEEE
16 years 25 days ago
Minimizing Probing Cost for Detecting Interface Failures: Algorithms and Scalability Analysis
— The automatic detection of failures in IP paths is an essential step for operators to perform diagnosis or for overlays to adapt. We study a scenario where a set of monitors se...
Hung Xuan Nguyen, Renata Teixeira, Patrick Thiran,...
CEC
2008
IEEE
16 years 20 days ago
Path optimization for multiple objectives in directed graphs using genetic algorithms
Abstract— This paper presents a genetic algorithmic approach for finding efficient paths in directed graphs when optimizing multiple objectives. Its aim is to provide solutions...
Juan Rada, Ruben Parma, Wilmer Pereira
CISS
2008
IEEE
16 years 20 days ago
Optimal memoryless relays with noncoherent modulation
Abstract—We derive optimal memoryless relays using noncoherent modulation over additive white Gaussian noise (AWGN) channels with or without fading. The derivation is flexible, ...
David F. Crouse, Christian R. Berger, Shengli Zhou...
ICC
2008
IEEE
16 years 19 days ago
Throughput Analysis of Frequency-Agile Medium Access Control Protocols
Abstract—In this paper, we analyze three opportunistic multichannel MAC protocols that associate a newcoming terminal station to one of the access points available within its tra...
Alexandre de Baynast, Lili Wu, Petri Mähö...