Sciweavers

13214 search results - page 72 / 2643
» Pseudorandomness for network algorithms
Sort
View
SPAA
1994
ACM
15 years 10 months ago
Bounds on the Greedy Routing Algorithm for Array Networks
We analyze the performance of greedy routing for array networks by providing bounds on the average delay and the average number of packets in the system for the dynamic routing pr...
Michael Mitzenmacher
INFOCOM
2000
IEEE
15 years 10 months ago
Datagram Routing Algorithm for LEO Satellite Networks
Abstract—Satellite networks provide global coverage and support a wide range of services. Low Earth Orbit (LEO) satellites provide short round-trip delays and are becoming increa...
Eylem Ekici, Ian F. Akyildiz, Michael D. Bender
GLOBECOM
2008
IEEE
16 years 22 days ago
Second Order Distributed Consensus Time Synchronization Algorithm for Wireless Sensor Networks
Abstract—This paper proposes a novel discrete time secondorder distributed consensus time synchronization (SO-DCTS) algorithm for wireless sensor networks. The consensus properti...
Gang Xiong, Shalinee Kishore
TNN
1998
89views more  TNN 1998»
15 years 5 months ago
Fast training of recurrent networks based on the EM algorithm
— In this work, a probabilistic model is established for recurrent networks. The EM (expectation-maximization) algorithm is then applied to derive a new fast training algorithm f...
Sheng Ma, Chuanyi Ji
ICC
2008
IEEE
116views Communications» more  ICC 2008»
16 years 22 days ago
A New Link Scheduling Algorithm for Concurrent Tx/Rx Wireless Mesh Networks
— Wireless routers equipped with smart antennas are capable of forming beams to neighboring devices to transmit/receive multiple packets simultaneously, hence achieving high netw...
Kwan-Wu Chin