335 search results - page 23 / 67 » Solving the Hamiltonian path problem with a light-based comp... |
156
Voted
W2GIS
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Finding single pair shortest paths on surface is a fundamental problem in various domains, like Geographic Information Systems (GIS) 3D applications, robotic path plannin...
112
click to vote
ICCS
2001
Springer
15 years 8 months ago
2001
Springer
This study presents a Feynman–Kac path-integral implementation for solving the Dirichlet problem for Poisson’s equation. The algorithm is a modified “walk on spheres” (WO...
116
Voted
ICCSA
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. Given a simple n-sided polygon in the plane with a boundary partitioned into subchains some of which are convex and colored, we consider the following problem: Which is t...
123
click to vote
INFOCOM
2003
IEEE
15 years 8 months ago
2003
IEEE
— We investigate the problem of computing the types of the relationships between Internet Autonomous Systems. We refer to the model introduced in [1], [2] that bases the discover...
160
Voted
ICRA
2000
IEEE
15 years 7 months ago
2000
IEEE
A simple and efficient randomized algorithm is presented for solving single-query path planning problems in high-dimensional configuration spaces. The method works by incrementall...