2796 search results - page 60 / 560 » The coolest path problem |
104
click to vote
FAW
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We study a constrained version of the shortest path problem in polygonal domains, in which the path must visit a given target polygon. We provide an efficient algorithm f...
BROADNETS
2007
IEEE
15 years 6 months ago
2007
IEEE
—Online energy aware routing in wireless networks is the problem of finding energy efficient routes that maximize the network lifetime without the knowledge of future message flo...
TSMC
2002
14 years 11 months ago
2002
Abstract--The notion of the necessary criticality (both with respect to path and to activity) of a network with imprecisely defined (by means of intervals or fuzzy intervals) activ...
ICDCSW
2002
IEEE
15 years 4 months ago
2002
IEEE
In this paper, we focus on the problem of secure multicast in dynamic groups. In this problem, a group of users communicate using a shared key. Due to the dynamic nature of these ...
ICRA
2005
IEEE
15 years 5 months ago
2005
IEEE
— The work presented in this paper addresses the problem of the stitching task in laparoscopic surgery using a circular needle and a conventional 4 DOFs needle-holder. This task ...