Sciweavers

8695 search results - page 129 / 1739
» Making the Complex Simple
Sort
View
87
Voted
TCBB
2010
122views more  TCBB 2010»
14 years 11 months ago
On the Complexity of uSPR Distance
We show that subtree prune and regraft (uSPR) distance on unrooted trees is fixed parameter tractable with respect to the distance. We also make progress on a conjecture of Steel...
Maria Luisa Bonet, Katherine St. John
113
Voted
DAC
2000
ACM
16 years 1 months ago
Power minimization using control generated clocks
In this paper we describe an area efficient power minimization scheme "Control Generated ClockingI` that saves significant amounts of power in datapath registers and clock dr...
M. Srikanth Rao, S. K. Nandy
91
Voted
ICSEA
2008
IEEE
15 years 7 months ago
Reuse through Requirements Traceability
The Reuse of code artefacts can make development quicker, cheaper and more robust, but the process is complex and has many pitfalls: Code artefacts must exist, be available, be fo...
Rob Pooley, Craig Warren
92
Voted
ICCAD
2002
IEEE
112views Hardware» more  ICCAD 2002»
15 years 5 months ago
ATPG-based logic synthesis: an overview
The ultimate goal of logic synthesis is to explore implementation flexibility toward meeting design targets, such as area, power, and delay. Traditionally, such flexibility is exp...
Chih-Wei Jim Chang, Malgorzata Marek-Sadowska
125
Voted
CASCON
2004
129views Education» more  CASCON 2004»
15 years 2 months ago
Practical language-independent detection of near-miss clones
Previous research shows that most software systems contain significant amounts of duplicated, or cloned, code. Some clones are exact duplicates of each other, while others differ ...
James R. Cordy, Thomas R. Dean, Nikita Synytskyy