2796 search results - page 36 / 560 » The coolest path problem |
124
click to vote
CEC
2010
IEEE
14 years 3 months ago
2010
IEEE
— Efficient vehicle path planning in hostile environment to carry out rescue or tactical logistic missions remains very challenging. Most approaches reported so far relies on key...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
We study the problem of finding the least-priced path (LPP) between a source and a destination in opportunistic spectrum access (OSA) networks. This problem is motivated by econo...
CISS
2008
IEEE
15 years 6 months ago
2008
IEEE
— Mobile Backbone Networks are heterogeneous wireless networks in which a subset of the nodes are more capable than others. The more capable nodes are referred to as Mobile Backb...
BIBE
2007
IEEE
15 years 6 months ago
2007
IEEE
—We investigate the k-LCS problem that is finding a longest common subsequence (LCS) for k given input strings. The problem is known to have practical solutions for k = 2, but f...
111
click to vote
SSD
2005
Springer
15 years 5 months ago
2005
Springer
This paper proposes and solves a-autonomy and k-stops shortest path problems in large spatial databases. Given a source s and a destination d, an aautonomy query retrieves a sequen...