3678 search results - page 77 / 736 » On the Stable Paths Problem |
77
Voted
IJFCS
2007
15 years 17 days ago
2007
We extend an algorithm by Paige and Tarjan that solves the coarsest stable refinement problem to the domain of trees. The algorithm is used to minimize non-deterministic tree auto...
SIAMDM
2010
14 years 11 months ago
2010
A connected graph G is called t-perfect if its stable set polytope is determined by the non-negativity, edge and odd-cycle inequalities. Moreover, G is called strongly t-perfect i...
AAAI
2010
15 years 26 days ago
2010
An optimization variant of a problem of path planning for multiple robots is addressed in this work. The task is to find spatial-temporal path for each robot of a group of robots ...
115
click to vote
ICCSA
2004
Springer
15 years 6 months ago
2004
Springer
The end-to-end characteristic is an important factor for QoS support. Since network users and their required bandwidths for applications increase, the efficient usage of networks h...
98
Voted
ICNP
2003
IEEE
15 years 6 months ago
2003
IEEE
BGP has been deployed in Internet for more than a decade. However, the events that cause BGP topological changes are not well understood. Although large traces of routing updates ...