1172 search results - page 144 / 235 » Path Algorithms on Regular Graphs |
112
Voted
DIAGRAMS
2006
Springer
15 years 6 months ago
2006
Springer
We conducted eye-tracking studies of subjects solving the problem of finding shortest paths in a graph using a known procedure (Dijkstra's algorithm). The goal of these studie...
206
Voted
TAPAS
2011
14 years 9 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...
130
click to vote
ICPP
2005
IEEE
15 years 8 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...
103
click to vote
IPPS
1994
IEEE
15 years 6 months ago
1994
IEEE
Many algorithms to schedule DAGs on multiprocessors have been proposed, but there has been little work done to determine their effectiveness. Since multi-processor scheduling is a...
117
click to vote
PR
2007
15 years 2 months ago
2007
We consider the problem of partial shape matching. We propose to transform shapes into sequences and utilize an algorithm that determines a subsequence of a target sequence that b...