3602 search results - page 152 / 721 » Isn't It About Time |
DAC
1994
ACM
14 years 2 months ago
1994
ACM
A new partitioningapproach for very largecircuits is described. We demonstrate that applying a recently developed analytical placement algorithm, that pro ts from a linear objecti...
ESWS
2007
Springer
14 years 2 months ago
2007
Springer
Many approaches to learning and teaching rely upon students working in groups. Formation of optimal groups can be a time consuming and complex task, particularly when the list of ...
BIRTHDAY
2006
Springer
14 years 2 months ago
2006
Springer
We recall the contribution of Goguen and Burstall's 1980 CAT paper and its powerful influence on theories of specification implementation that were emerging at about the same ...
DATE
2004
IEEE
14 years 2 months ago
2004
IEEE
This paper presents a realizable RLMC1 reduction algorithm for extracted interconnect circuits based on two effective approaches: RL branch reduction and RC/LC node reduction. Our...
COCOON
2006
Springer
14 years 2 months ago
2006
Springer
Abstract. While the complexity of min-max and min-max regret versions of most classical combinatorial optimization problems has been thoroughly investigated, there are very few stu...