613 search results - page 97 / 123 » Time Optimal Self-Stabilizing Spanning Tree Algorithms |
INFOCOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— Packet filtering plays a critical role in the performance of many network devices such as firewalls, IPSec gateways, DiffServ and QoS routers. A tremendous amount of research...
CORR
2006
Springer
14 years 11 months ago
2006
Springer
We show that the neighbor-joining algorithm is a robust quartet method for constructing trees from distances. This leads to a new performance guarantee that contains Atteson's...
110
Voted
ICC
2007
IEEE
15 years 6 months ago
2007
IEEE
— Many previously proposed routing metrics and algorithms for ad hoc networks work well in static networks, however, when nodes are moving and wireless links may fail from time t...
110
click to vote
QOSIP
2005
Springer
15 years 5 months ago
2005
Springer
Abstract. We explore techniques for efficient Quality of Service Routing in the presence of multiple constraints. We first present a polynomial time approximation algorithm for th...
ATMOS
2007
15 years 1 months ago
2007
Abstract. Approximate dynamic programming offers a new modeling and algorithmic strategy for complex problems such as rail operations. Problems in rail operations are often modeled...