Sciweavers

15 search results - page 3 / 3
» Formalizing Multi-Agent POMDP's in the context of network ro...
Sort
View
ESA
2005
Springer
128views Algorithms» more  ESA 2005»
13 years 10 months ago
Greedy Routing in Tree-Decomposed Graphs
Milgram’s experiment (1967) demonstrated that there are short chains of acquaintances between individuals, and that these chains can be discovered in a greedy manner. Kleinberg ...
Pierre Fraigniaud
ESWS
2004
Springer
13 years 10 months ago
Publish/Subscribe for RDF-based P2P Networks
Publish/subscribe systems are an alternative to query based systems in cases where the same information is asked for over and over, and where clients want to get updated answers fo...
Paul-Alexandru Chirita, Stratos Idreos, Manolis Ko...
GIS
2005
ACM
14 years 5 months ago
Contraflow network reconfiguration for evacuation planning: a summary of results
Contraflow, or lane reversal, is a way of increasing outbound capacity of a real network by reversing the direction of inbound roads during evacuations. The contraflow is consider...
Sangho Kim, Shashi Shekhar
TIFS
2008
149views more  TIFS 2008»
13 years 4 months ago
Secure Cooperation in Autonomous Mobile Ad-Hoc Networks Under Noise and Imperfect Monitoring: A Game-Theoretic Approach
In autonomous mobile ad-hoc networks, one major challenge is to stimulate cooperation among selfish nodes, especially when some nodes may be malicious. In this paper, we address co...
Wei Yu, K. J. Ray Liu
CN
2004
150views more  CN 2004»
13 years 4 months ago
Optimizing interconnection policies
There are two basic types of interconnection agreements between providers in the Internet: peering and transit. A decision every Internet network service provider (INSP) has to ma...
Oliver Heckmann, Jens Schmitt, Ralf Steinmetz