Sciweavers

707 search results - page 45 / 142
» Solving path problems on the GPU
Sort
View
ICFP
2008
ACM
15 years 11 months ago
Write it recursively: a generic framework for optimal path queries
Optimal path queries are queries to obtain an optimal path specified by a given criterion of optimality. There have been many studies to give efficient algorithms for classes of o...
Akimasa Morihata, Kiminori Matsuzaki, Masato Takei...
SCHEDULING
2008
67views more  SCHEDULING 2008»
14 years 11 months ago
Exact train pathing
Suppose we are given a schedule of train movements over a rail network into which a new train is to be included. The origin and the destination are specified for the new train; it...
Viswanath Nagarajan, Abhiram G. Ranade
ISVD
2007
IEEE
15 years 6 months ago
Time Convex Hull with a Highway
We consider the problem of computing the time convex hull of a set of points in the presence of a straight-line highway in the plane. The traveling speed in the plane is assumed t...
Teng-Kai Yu, D. T. Lee
GLOBECOM
2006
IEEE
15 years 5 months ago
Optimal Routing in the Worst-Case-Error Metric
— This paper considers the problem of finding the path with minimum (zero) worst possible number of errors in a network with V nodes where (1) some nodes are capable of correcti...
Edwin Soedarmadji
ICCAD
2000
IEEE
74views Hardware» more  ICCAD 2000»
15 years 4 months ago
Simultaneous Gate Sizing and Fanout Optimization
This paper describes an algorithm for simultaneous gate sizing and fanout optimization along the timing-critical paths in a circuit. First, a continuous-variable delay model that ...
Wei Chen, Cheng-Ta Hsieh, Massoud Pedram