3678 search results - page 487 / 736 » On the Stable Paths Problem |
136
click to vote
ISPD
1999
ACM
15 years 9 months ago
1999
ACM
—Maze routing algorithms are widely used for finding an optimal path in detailed routing for very large scale integration, printed circuit board and multichip modules In this pap...
117
click to vote
IPPS
1998
IEEE
15 years 9 months ago
1998
IEEE
We study the problem of mapping the N nodes of a complete t-ary tree on M memory modules so that they can be accessed in parallel by templates, i.e. distinct sets of nodes. Typica...
133
click to vote
MICRO
1998
IEEE
15 years 9 months ago
1998
IEEE
This paper evaluates several mechanisms for repairing the return-address stack after branch mispredictions. The return-address stack is a small but important structure for achievi...
176
click to vote
ITC
1993
IEEE
15 years 9 months ago
1993
IEEE
This paper presents an efficient approach to generate tests for gate delay faults. Unlike other known algorithms which try to generate a 'good' delay test the presented ...
127
click to vote
DAC
2010
ACM
15 years 9 months ago
2010
ACM
This paper studies the implementation of Boolean functions with lattices of two-dimensional switches. Each switch is controlled by a Boolean literal. If the literal is 1, the swit...