2926 search results - page 550 / 586 » Partially Optimal Routing |
ADHOCNOW
2009
Springer
14 years 5 months ago
2009
Springer
Abstract. Robots coordinate among themselves to select one of them to respond to an event reported to one of robots. The goal is to minimize the communication cost of selecting bes...
ASPDAC
2009
ACM
14 years 5 months ago
2009
ACM
— Power distribution networks (PDNs) are designed and analyzed iteratively. Random walk is among the most efficient methods for PDN analysis. We develop in this paper an increme...
SIGCOMM
2009
ACM
14 years 5 months ago
2009
ACM
Since the early days of networks, a basic principle has been that endpoints treat the network as a black box. An endpoint injects a packet with a destination address and the netwo...
SIGCOMM
2009
ACM
14 years 5 months ago
2009
ACM
As forwarding tables and link speeds continue to grow, fast packet forwarding becomes increasingly challenging for enterprise edge routers. Simply building routers with ever large...
FOCS
2008
IEEE
14 years 5 months ago
2008
IEEE
We study the properties of embeddings, multicommodity flows, and sparse cuts in minor-closed families of graphs which are also closed under 2-sums; this includes planar graphs, g...