707 search results - page 31 / 142 » Solving path problems on the GPU |
INFOCOM
1997
IEEE
15 years 4 months ago
1997
IEEE
In earlier work we have formulated a collusion problem that determines whether it is possible for a set of colluders to collectively discover a target set of information, starting...
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...
103
click to vote
COMBINATORICS
2002
14 years 11 months ago
2002
In a previous work [26], by considering paths that are partially weighted, the generating function of Dyck paths was shown to possess a type of symmetry, called an exchange relati...
136
click to vote
SMC
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract--Finding the longest simple path in a generic undirected graph is a challenging issue that belongs to the NPComplete class of problems. Four approaches based on genetic al...
114
click to vote
TCS
2011
14 years 6 months ago
2011
The problem of computing minimum distortion embeddings of a given graph into a line (path) was introduced in 2004 and has quickly attracted significant attention with subsequent ...