6045 search results - page 836 / 1209 » Computable Linearizations of Well-partial-orderings |
159
click to vote
ICCAD
2005
IEEE
16 years 3 months ago
2005
IEEE
— In this paper we propose an exact algorithm that maximizes the sharing of partial terms in Multiple Constant Multiplication (MCM) operations. We model this problem as a Boolean...
170
click to vote
ICCAD
2004
IEEE
16 years 3 months ago
2004
IEEE
While process variations are becoming more significant with each new IC technology generation, they are often modeled via linear regression models so that the resulting performanc...
170
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
In this paper, we study the problem of retiming of sequential circuits with both interconnect and gate delay. Most retiming algorithms have assumed ideal conditions for the non-lo...
183
click to vote
ICCAD
2003
IEEE
16 years 3 months ago
2003
IEEE
– Many embedded system designs usually impose (hard) read-time constraints on tasks. Thus, computing a tight upper bound of the worst case execution time (WCET) of a software is ...
217
click to vote
SOSP
2007
ACM
16 years 3 months ago
2007
ACM
We propose a new paradigm for building scalable distributed systems. Our approach does not require dealing with message-passing protocols—a major complication in existing distri...