Sciweavers

707 search results - page 31 / 142
» Solving path problems on the GPU
Sort
View
INFOCOM
1997
IEEE
15 years 7 months ago
An Algorithm to Compute Collusion Paths
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...
Steven H. Low, Nicholas F. Maxemchuk
SSD
2005
Springer
153views Database» more  SSD 2005»
15 years 8 months ago
Constrained Shortest Path Computation
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...
Manolis Terrovitis, Spiridon Bakiras, Dimitris Pap...
COMBINATORICS
2002
104views more  COMBINATORICS 2002»
15 years 3 months ago
Exchange Symmetries in Motzkin Path and Bargraph Models of Copolymer Adsorption
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...
E. J. Janse van Rensburg, A. Rechnitzer
SMC
2010
IEEE
158views Control Systems» more  SMC 2010»
15 years 1 months ago
A study of genetic algorithms for approximating the longest path in generic graphs
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...
David Portugal, Carlos Henggeler Antunes, Rui Roch...
TCS
2011
14 years 10 months ago
Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs
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 ...
Pinar Heggernes, Daniel Meister, Andrzej Proskurow...