Sciweavers

413 search results - page 1 / 83
» On Solving Geometric Optimization Problems Using Shortest Pa...
Sort
View
COMPGEOM
1990
ACM
13 years 10 months ago
On Solving Geometric Optimization Problems Using Shortest Paths
Elefterios A. Melissaratos, Diane L. Souvaine

Publication
2630views
15 years 5 months ago
DIJKSTRA’S and Fast Marching Method for Optimal Path Planning
This technical report illustrates the differences in solving the optimal path problem (shortest path) using different methods, where the underlying PDE can be described by the eik...
RYO TAKEI
GECCO
2006
Springer
200views Optimization» more  GECCO 2006»
13 years 9 months ago
A new approach for shortest path routing problem by random key-based GA
In this paper, we propose a Genetic Algorithm (GA) approach using a new paths growth procedure by the random key-based encoding for solving Shortest Path Routing (SPR) problem. An...
Mitsuo Gen, Lin Lin
PC
2010
196views Management» more  PC 2010»
13 years 4 months ago
Solving path problems on the GPU
We consider the computation of shortest paths on Graphic Processing Units (GPUs). The blocked recursive elimination strategy we use is applicable to a class of algorithms (such as...
Aydin Buluç, John R. Gilbert, Ceren Budak
COCO
2000
Springer
123views Algorithms» more  COCO 2000»
13 years 10 months ago
A Lower Bound for the Shortest Path Problem
We show that the Shortest Path Problem cannot be solved in o(log n) time on an unbounded fan-in PRAM without bit operations using poly(n) processors even when the bit-lengths of t...
Ketan Mulmuley, Pradyut Shah