Sciweavers

1016 search results - page 123 / 204
» Optimized algorithms for multi-agent routing
Sort
View
SIGOPS
2010
127views more  SIGOPS 2010»
14 years 8 months ago
Optimizing information flow in the gossip objects platform
Gossip-based protocols are commonly used for diffusing information in large-scale distributed applications. GO (Gossip Objects) is a per-node gossip platform that we developed in...
Ymir Vigfusson, Ken Birman, Qi Huang, Deepak P. Na...
AIPS
2008
15 years 4 days ago
Fast Planning for Dynamic Preferences
We present an algorithm that quickly finds optimal plans for unforeseen agent preferences within graph-based planning domains where actions have deterministic outcomes and action ...
Brian Ziebart, Anind K. Dey, J. Andrew Bagnell
SIGMETRICS
2008
ACM
111views Hardware» more  SIGMETRICS 2008»
14 years 9 months ago
Hierarchical routing over dynamic wireless networks
Dynamic networks are those where the topology changes over time and therefore efficient routes need to be maintained by frequent updates. Such updates could be costly in terms of ...
Dominique Tschopp, Suhas N. Diggavi, Matthias Gros...
COMSWARE
2007
IEEE
15 years 1 months ago
On Configuring BGP Route Reflectors
The Border Gateway Protocol (BGP) is the standard protocol for exchanging routing information between border routers of Autonomous Systems (ASes) in today's Internet. Within a...
Yuri Breitbart, Minos N. Garofalakis, Anupam Gupta...
INFOCOM
2003
IEEE
15 years 3 months ago
IP-Subnet Aware Routing in WDM Mesh Networks
Abstract— We explore the problem of routing bandwidth guaranteed paths in wavelength-routed, WDM optical mesh networks. A WDM mesh network offers great flexibility in dynamicall...
Swarup Acharya, Bhawna Gupta, Pankaj Risbood, Anur...