3678 search results - page 198 / 736 » On the Stable Paths Problem |
117
click to vote
IMC
2005
ACM
15 years 9 months ago
2005
ACM
If a host can send packets larger than an Internet path can forward, it relies on the timely delivery of Internet Control Message Protocol (ICMP) messages advising that the packet...
164
Voted
DBPL
2001
Springer
15 years 8 months ago
2001
Springer
Abstract. We are interested in the theoretical foundations of the optimization of conjunctive regular path queries (CRPQs). The basic problem here is deciding query containment bot...
115
click to vote
ICRA
2000
IEEE
15 years 8 months ago
2000
IEEE
This paper addresses the problem of path planning for a class of deformable volumes under fairly general manipulation constraints. The underlying geometric model for the volume is...
123
Voted
DM
2007
15 years 3 months ago
2007
Given a set P of at most 2n − 4 prescribed edges (n ≥ 5) and vertices u and v whose mutual distance is odd, the n-dimensional hypercube Qn contains a hamiltonian path between ...
136
click to vote
SCHEDULING
2008
15 years 3 months ago
2008
We consider the packet routing problem in store-and-forward networks whose topologies are either paths, trees, or rings. We are interested by the quality of the solution produced,...