707 search results - page 43 / 142 » Solving path problems on the GPU |
ICCAD
1999
IEEE
15 years 4 months ago
1999
IEEE
: In this paper, an algorithm for simultaneous logic restructuring and placement is presented. This algorithm first constructs a set of super-cells along the critical paths and the...
100
click to vote
PODC
2006
ACM
15 years 5 months ago
2006
ACM
We study a novel separator property called k-path separable. Roughly speaking, a k-path separable graph can be recursively separated into smaller components by sequentially removi...
WEA
2004
Springer
15 years 5 months ago
2004
Springer
Abstract. Graphs can be represented symbolically by the Ordered Binary Decision Diagram (OBDD) of their characteristic function. To solve problems in such implicitly given graphs, ...
109
click to vote
MOBICOM
2003
ACM
15 years 5 months ago
2003
ACM
We develop algorithms for finding minimum energy disjoint paths in an all-wireless network, for both the node and linkdisjoint cases. Our major results include a novel polynomial...
ICRA
2002
IEEE
15 years 4 months ago
2002
IEEE
This paper describes TEMPEST, a planner that enables a solar-powered rover to reason about path selection and event placement in terms of available solar energy and anticipated po...