Sciweavers

707 search results - page 33 / 142
» Solving path problems on the GPU
Sort
View
MP
2008
135views more  MP 2008»
14 years 11 months ago
A path to the Arrow-Debreu competitive market equilibrium
: We present polynomial-time interior-point algorithms for solving the Fisher and Arrow-Debreu competitive market equilibrium problems with linear utilities and n players. Both of ...
Yinyu Ye
COMPGEOM
2005
ACM
15 years 1 months ago
Shortest path amidst disc obstacles is computable
An open question in Exact Geometric Computation is whether there are transcendental computations that can be made “geometrically exact”. Perhaps the simplest such problem in c...
Ee-Chien Chang, Sung Woo Choi, DoYong Kwon, Hyungj...
ICRA
2010
IEEE
148views Robotics» more  ICRA 2010»
14 years 9 months ago
Global reachability and path planning for planetary exploration with montgolfiere balloons
Aerial vehicles are appealing systems for possible future exploration of planets and moons such as Venus and Titan, because they combine extensive coverage with highresolution data...
Lars Blackmore, Yoshiaki Kuwata, Michael T. Wolf, ...
CCCG
1996
15 years 1 months ago
Heuristic Motion Planning with Many Degrees of Freedom
We present a heuristic approach to the geometric motion planning problem with the aim to quickly solve intuitively simple problems. It is based on a divide-and-conquer path search...
Thomas Chadzelek, Jens Eckstein, Elmar Schöme...
ICCAD
2006
IEEE
130views Hardware» more  ICCAD 2006»
15 years 8 months ago
On bounding the delay of a critical path
Process variations cause different behavior of timingdependent effects across different chips. In this work, we analyze one example of timing-dependent effects, crosscoupling ...
Leonard Lee, Li-C. Wang