707 search results - page 32 / 142 » Solving path problems on the GPU |
114
click to vote
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
We consider the problem of finding an optimal clock schedule, i.e. optimal arrival times for clock signals at latches of a VLSI chip. We describe a general model which includes al...
SIAMJO
2002
14 years 11 months ago
2002
A probability-one homotopy algorithm for solving nonsmooth equations is described. This algorithm is able to solve problems involving highly nonlinear equations, where the norm of ...
PLDI
2004
ACM
15 years 5 months ago
2004
ACM
Regular path queries are a way of declaratively expressing queries on graphs as regular-expression-like patterns that are matched against paths in the graph. There are two kinds o...
GLOBECOM
2006
IEEE
15 years 5 months ago
2006
IEEE
— We consider the path-determination problem in Internet core routers that distribute flows across alternate paths leading to the same destination. We assume that the remainder ...
109
click to vote
JCM
2007
14 years 11 months ago
2007
—Today, most routing problems are solved using Dijkstra’s shortest path algorithm. Many efficient implementations of Dijkstra’s algorithm exist and can handle large networks ...