2796 search results - page 88 / 560 » The coolest path problem |
126
click to vote
IMC
2005
ACM
15 years 10 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...
169
click to vote
DBPL
2001
Springer
15 years 9 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...
122
click to vote
ICRA
2000
IEEE
15 years 9 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...
145
Voted
SCHEDULING
2008
15 years 4 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,...
136
click to vote
INFOCOM
2010
IEEE
15 years 3 months ago
2010
IEEE
—False routing announcements are a serious security problem, which can lead to widespread service disruptions in the Internet. A number of detection systems have been proposed an...