Sciweavers

763 search results - page 62 / 153
» Engineering Shortest Path Algorithms
Sort
View
NIPS
1993
13 years 10 months ago
Packet Routing in Dynamically Changing Networks: A Reinforcement Learning Approach
This paper describes the Q-routing algorithm for packet routing, in which a reinforcement learning module is embedded into each node of a switching network. Only local communicati...
Justin A. Boyan, Michael L. Littman
HICSS
2003
IEEE
148views Biometrics» more  HICSS 2003»
14 years 2 months ago
Bluenet II - A Detailed Realization of the Algorithm and Performance
The recent interest in ad hoc networks, in general, and in the Bluetooth technology, in particular, has stimulated much research in algorithms for topology control of such network...
Zhifang Wang, Zygmunt J. Haas, Robert J. Thomas
ISCA
2008
IEEE
136views Hardware» more  ISCA 2008»
13 years 9 months ago
A Randomized Queueless Algorithm for Breadth-First Search
First Come First Served is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems [28, 11], scheduling web ...
K. Subramani, Kamesh Madduri
CN
2002
195views more  CN 2002»
13 years 8 months ago
A simulation study of the OSPF-OMP routing algorithm
Open shortest path first (OSPF) is the most widely used internal gateway routing protocol on the Internet. However, one shortcoming is that it does not take advantage of the exist...
G. Michael Schneider, Tamás Németh
CORR
2008
Springer
88views Education» more  CORR 2008»
13 years 9 months ago
Lower bounds for distributed markov chain problems
We study the worst-case communication complexity of distributed algorithms computing a path problem based on stationary distributions of random walks in a network G with the caveat...
Rahul Sami, Andy Twigg