2887 search results - page 334 / 578 » Name Generation and Linearity |
171
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
Traditional minimum area retiming algorithms attempt to achieve their prescribed objective with no regard to maintaining the initial state of the system. This issue is important f...
136
click to vote
ICCAD
1997
IEEE
15 years 10 months ago
1997
IEEE
— This paper describes an algorithm for generating provably passive reduced-order N-port models for RLC interconnect circuits. It is demonstrated that, in addition to macromodel ...
192
click to vote
RTSS
1997
IEEE
15 years 10 months ago
1997
IEEE
This paper presents an on-the-fly and symbolic algorithm for checking whether a timed automaton satisfies a formula of a timed temporal logic which is more expressive than TCTL....
165
click to vote
PLDI
1997
ACM
15 years 10 months ago
1997
ACM
We present a simple and novel framework for generating blocked codes for high-performance machines with a memory hierarchy. Unlike traditional compiler techniques like tiling, whi...
162
click to vote
ICCAD
1994
IEEE
15 years 10 months ago
1994
IEEE
In high level synthesis each node of a synchronous dataflow graph (DFG) is scheduled to a specific time and allocated to a processor. In this paper we present new integer linear p...