Sciweavers

13214 search results - page 353 / 2643
» Pseudorandomness for network algorithms
Sort
View
MOBICOM
2006
ACM
16 years 23 days ago
State-of-the-art in protocol research for underwater acoustic sensor networks
In this paper, architectures for two-dimensional and three-dimensional underwater sensor networks are discussed. A detailed overview on the current solutions for medium access con...
Ian F. Akyildiz, Dario Pompili, Tommaso Melodia
MWCN
2004
Springer
16 years 4 days ago
Minimum Power Symmetric Connectivity Problem in Wireless Networks: A New Approach
We consider the problem of assigning transmission powers to the nodes of a wireless network in such a way that all the nodes of the network are connected by bidirectional links and...
Roberto Montemanni, Luca Maria Gambardella
BROADNETS
2007
IEEE
15 years 10 months ago
Reinforcement learning based routing in all-optical networks with physical impairments
Abstract-- We present and evaluate a reinforcement learningbased RWA algorithm for all-optical networks subject to physical impairments. The technique is suitable for decentralized...
Yvan Pointurier, Fariba Heidari
JUCS
2010
124views more  JUCS 2010»
15 years 5 months ago
Finding a Consistent Scenario to an Interval Algebra Network Containing Possibly Infinite Intervals
: Interval algebra networks are traditionally defined over finite intervals. In this paper, we relax this restriction by allowing one or more of the intervals involved to be infini...
André Trudel
ICASSP
2011
IEEE
14 years 10 months ago
On the success of network inference using a markov routing model
In this paper we discuss why a simple network topology inference algorithm based on network co-occurrence measurements and a Markov random walk model for routing enables perfect t...
Laura Balzano, Robert Nowak, Matthew Roughan