935 search results - page 38 / 187 » The directional p |
IPPS
2007
IEEE
14 years 1 months ago
2007
IEEE
Let P be a family of dipaths. The load of an arc is the number of dipaths containing this arc. Let π(G, P) be the maximum of the load of all the arcs and let w(G, P) be the minim...
HPDC
2008
IEEE
14 years 2 months ago
2008
IEEE
Self-configuring virtual networks rely on structured P2P routing to provide seamless connectivity among nodes through overlay routing of virtual IP packets, support decentralized...
FOCS
2010
IEEE
13 years 5 months ago
2010
IEEE
Let G be a directed edge-weighted graph and let P be a shortest path from s to t in G. The replacement paths problem asks to compute, for every edge e on P, the shortest s-to-t pat...
NETWORK
2006
13 years 7 months ago
2006
: The scalability of large-scale networked virtual environments (NVEs) suchastoday's Massively Multiplayer Online Games (MMOGs) faces inherent limits imposed by the client-ser...
AAMAS
1998
Springer
13 years 7 months ago
1998
Springer
This paper provides an overview of research and development activities in the field of autonomous agents and multi-agent systems. It aims to identify key concepts and applications...