Sciweavers

191 search results - page 30 / 39
» Time Efficient Gossiping in Known Radio Networks
Sort
View
CONEXT
2009
ACM
15 years 7 months ago
The age of impatience: optimal replication schemes for opportunistic networks
: We study mobile P2P content dissemination schemes which leverage the local dedicated caches provided by hand-held devices (e.g., smart-phones, PDAs) and opportunistic contacts be...
Joshua Reich, Augustin Chaintreau
TPDS
2008
188views more  TPDS 2008»
15 years 6 months ago
Interference-Aware Joint Routing and TDMA Link Scheduling for Static Wireless Networks
We study efficient interference-aware joint routing and TDMA link scheduling for a multihop wireless network to maximize its throughput. Efficient link scheduling can greatly reduc...
Yu Wang 0003, Weizhao Wang, Xiang-Yang Li, Wen-Zha...
CN
2004
108views more  CN 2004»
15 years 5 months ago
Routing bandwidth-guaranteed paths with restoration in label-switched networks
Label switched networks have become increasingly attractive to both network providers and customers. By creating aggregate, bandwidth-reserved flows, these networks offer routing ...
Samphel Norden, Milind M. Buddhikot, Marcel Waldvo...
NN
2000
Springer
192views Neural Networks» more  NN 2000»
15 years 5 months ago
A new algorithm for learning in piecewise-linear neural networks
Piecewise-linear (PWL) neural networks are widely known for their amenability to digital implementation. This paper presents a new algorithm for learning in PWL networks consistin...
Emad Gad, Amir F. Atiya, Samir I. Shaheen, Ayman E...
ICC
1997
IEEE
158views Communications» more  ICC 1997»
15 years 10 months ago
The Priority Token Bank in a Network of Queues
This paper takes a known approach for scheduling and admission control in integrated services networks1 , the Priority Token Bank (PTB), whose mechanism and performance have been ...
Mark A. Lynn, Jon M. Peha