707 search results - page 66 / 142 » Solving path problems on the GPU |
ICDAR
2005
IEEE
15 years 5 months ago
2005
IEEE
Problem of recovering a writing order from singlestroked handwritten image can be seen as finding the smoothest Euler path in its graph representation. In this paper, a novel appr...
118
click to vote
ICWMC
2006
IEEE
15 years 5 months ago
2006
IEEE
Because of the heterogeneity in radio transceiver capabilities and influence of surroundings, unidirectional links arise in wireless mobile ad-hoc networks. Since most of existin...
ECAI
2008
Springer
15 years 1 months ago
2008
Springer
Abstract. We propose a SAT-based algorithm for incremental diagnosis of discrete-event systems. The monotonicity is ensured by a prediction window that uses the future observations...
TON
2008
14 years 11 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
IPPS
2000
IEEE
15 years 4 months ago
2000
IEEE
In the past few years since Adleman’s pioneering work on solving the HPP(Hamiltonian Path Problem) with a DNA-based computer [1], many algorithms have been designed on solving NP...