Sciweavers

231 search results - page 8 / 47
» Path disruption games
Sort
View
ESA
2008
Springer
137views Algorithms» more  ESA 2008»
14 years 11 months ago
Flexible Path Planning Using Corridor Maps
Path planning is a central problem in virtual environments and games. When computer-controlled characters move around in virtual worlds they have to plan their paths to desired loc...
Mark H. Overmars, Ioannis Karamouzas, Roland Gerae...
CCS
2005
ACM
15 years 3 months ago
Countering DoS attacks with stateless multipath overlays
Indirection-based overlay networks (IONs) are a promising approach for countering distributed denial of service (DDoS) attacks. Such mechanisms are based on the assumption that at...
Angelos Stavrou, Angelos D. Keromytis
AAIM
2006
Springer
121views Algorithms» more  AAIM 2006»
15 years 3 months ago
Atomic Routing Games on Maximum Congestion
We study atomic routing games on networks in which players choose a path with the objective of minimizing the maximum congestion along the edges of their path. The social cost is t...
Costas Busch, Malik Magdon-Ismail
COLT
2004
Springer
15 years 3 months ago
Reinforcement Learning for Average Reward Zero-Sum Games
Abstract. We consider Reinforcement Learning for average reward zerosum stochastic games. We present and analyze two algorithms. The first is based on relative Q-learning and the ...
Shie Mannor
BROADNETS
2007
IEEE
15 years 4 months ago
IP fast rerouting for single-link/node failure recovery
—Failure recovery in IP networks is critical to high quality service provisioning. The main challenge is how to achieve fast recovery without introducing high complexity and reso...
Kang Xi, H. Jonathan Chao