422 search results - page 67 / 85 » Shortest paths between shortest paths and independent sets |
CVPR
2005
IEEE
14 years 10 months ago
2005
IEEE
We propose using the inner-distance between landmark points to build shape descriptors. The inner-distance is defined as the length of the shortest path between landmark points wi...
ICPP
2005
IEEE
14 years 2 months ago
2005
IEEE
In this paper we introduce a new algorithm for computing near optimal schedules for task graph problems. In contrast to conventional approaches for solving those scheduling proble...
INFOCOM
2003
IEEE
14 years 1 months ago
2003
IEEE
— There are two fundamental technology issues that challenge the robustness of IP backbones. First, SONET protection is gradually being removed because of its high cost (while SO...
KI
2001
Springer
14 years 1 months ago
2001
Springer
Having to cope with memory limitations is an ubiquitous issue in heuristic search. We present theoretical and practical results on new variants for exploring state-space with respe...
TAPAS
2011
13 years 3 months ago
2011
Every human likes choices. But today’s fast route planning algorithms usually compute just a single route between source and target. There are beginnings to compute alternative r...