Sciweavers

189 search results - page 18 / 38
» Shortest Paths Without a Map
Sort
View
HICSS
2003
IEEE
183views Biometrics» more  HICSS 2003»
14 years 1 months ago
CRMA: A Cycle-breaking Multicast Routing Algorithm for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
ISCC
2003
IEEE
130views Communications» more  ISCC 2003»
14 years 1 months ago
Congestion-Aware Multicast Routing for Supporting QoS over the Internet
Multicasting is an efficient and effective approach for supporting content distribution based on the current Internet infrastructure. In this paper, we have proposes the source-in...
Jian Zhao, Hossam S. Hassanein, Jieyi Wu, Junzhou ...
INFOCOM
1998
IEEE
14 years 1 days ago
Loop-Free Multipath Routing Using Generalized Diffusing Computations
A new distributed algorithm for the dynamic computation of multiple loop-free paths from source to destination in a computer network or internet are presented,validated, and analy...
William T. Zaumen, J. J. Garcia-Luna-Aceves
SIGMOD
2010
ACM
202views Database» more  SIGMOD 2010»
14 years 18 days ago
PAROS: pareto optimal route selection
Modern maps provide a variety of information about roads and their surrounding landscape allowing navigation systems to go beyond simple shortest path computation. In this demo, w...
Franz Graf, Hans-Peter Kriegel, Matthias Renz, Mat...
EVOW
2010
Springer
14 years 2 months ago
Evolving Individual Behavior in a Multi-agent Traffic Simulator
Abstract. In this paper, we illustrate the use of evolutionary agents in a multiagent system designed to describe the behavior of car drivers. Each agent has the selfish objective ...
Ernesto Sánchez, Giovanni Squillero, Albert...