2796 search results - page 429 / 560 » The coolest path problem |
177
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
We consider the problem of testing for delay faults in macrobased circuits. Macro-based circuits are obtained as a result of technology mapping. Gate-level fault models cannot be ...
155
click to vote
FPL
2006
Springer
15 years 10 months ago
2006
Springer
We present a heavily parametrized tool suite that allows the modeling and exploration of heterogeneous, coarse-grained, heavily pipelined reconfigurable architectures. Our tools p...
171
click to vote
WSC
1997
15 years 7 months ago
1997
The paper is devoted to a brief review of a mathematical theory for the branching variance-reduction technique. The branching technique is an extension of von Neumann’s splittin...
134
click to vote
EOR
2006
15 years 6 months ago
2006
In this work, we provide two heuristic algorithms for the matrix bandwidth reduction problem. The first is a genetic algorithm and the second uses node label adjustments. Experime...
136
click to vote
RAS
2006
15 years 6 months ago
2006
This paper describes an algorithm to calculate near-optimal minimum time trajectories for four wheeled omnidirectional vehicles, which can be used as part of a high-level path pla...