68 search results - page 14 / 14 » A Reach and Bound algorithm for acyclic dynamic-programming ... |
ICALP
2003
Springer
13 years 10 months ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
PODC
2012
ACM
11 years 7 months ago
2012
ACM
In recent years, there have been a few proposals to add a small amount of trusted hardware at each replica in a Byzantine fault tolerant system to cut back replication factors. Th...
STOC
2006
ACM
14 years 5 months ago
2006
ACM
We study rerouting policies in a dynamic round-based variant of a well known game theoretic traffic model due to Wardrop. Previous analyses (mostly in the context of selfish routi...