Sciweavers

59 search results - page 1 / 12
» A reduction approach to the repeated assignment problem
Sort
View
EOR
2011
97views more  EOR 2011»
12 years 12 months ago
A reduction approach to the repeated assignment problem
Daisuke Yokoya, Cees W. Duin, Takeo Yamada
DAC
2005
ACM
14 years 5 months ago
Net weighting to reduce repeater counts during placement
We demonstrate how to use placement to ameliorate the predicted repeater explosion problem caused by poor interconnect scaling. We achieve repeater count reduction by dynamically ...
Brent Goplen, Prashant Saxena, Sachin S. Sapatneka...
DAC
2004
ACM
13 years 8 months ago
Practical repeater insertion for low power: what repeater library do we need?
In this paper, we investigate the problem of repeater insertion for low power under a given timing budget. We propose a novel repeater insertion algorithm to compute the optimal r...
Xun Liu, Yuantao Peng, Marios C. Papaefthymiou
ITC
2003
IEEE
214views Hardware» more  ITC 2003»
13 years 10 months ago
ATPG Padding And ATE Vector Repeat Per Port For Reducing Test Data Volume
This paper presents an approach for reducing the test data volume that has to be stored in ATE vector memory for IC manufacturing testing. We exploit the capabilities of present A...
Harald P. E. Vranken, Friedrich Hapke, Soenke Rogg...
RECOMB
2001
Springer
14 years 5 months ago
A new approach to fragment assembly in DNA sequencing
For the last twenty years fragment assembly in DNA sequencing followed the "overlap - layout - consensus" paradigm that is used in all currently available assembly tools...
Pavel A. Pevzner, Haixu Tang, Michael S. Waterman