Sciweavers

1920 search results - page 21 / 384
» The Complexity of the A B C Problem
Sort
View
SIU
2002
97views more  SIU 2002»
15 years 5 months ago
Problem Generators for Rectangular packing problems
Abstract. In order to verify and test the performance of new packing algorithms relative to existing algorithms, test problems are needed. The scope of published test instances for...
E. Hopper, B. C. H. Turton
ASPDAC
2007
ACM
88views Hardware» more  ASPDAC 2007»
15 years 9 months ago
Voltage Island Generation under Performance Requirement for SoC Designs
Using multiple supply voltages on a SoC design is an efficient way to achieve low power. However, it may lead to a complex power network and a huge number of level shifters if we j...
Wai-Kei Mak, Jr-Wei Chen
DATE
2005
IEEE
107views Hardware» more  DATE 2005»
15 years 11 months ago
Exploring NoC Mapping Strategies: An Energy and Timing Aware Technique
Complex applications implemented as Systems on Chip (SoCs) demand extensive use of system level modeling and validation. Their implementation gathers a large number of complex IP ...
César A. M. Marcon, Ney Laert Vilar Calazan...
162
Voted
ALGORITHMICA
2007
114views more  ALGORITHMICA 2007»
15 years 5 months ago
The Consecutive Ones Submatrix Problem for Sparse Matrices
A 0-1 matrix has the Consecutive Ones Property (C1P) if there is a permutation of its columns that leaves the 1’s consecutive in each row. The Consecutive Ones Submatrix (C1S) p...
Jinsong Tan, Louxin Zhang
ICSM
2003
IEEE
15 years 11 months ago
Reverse Engineering of the Interaction Diagrams from C++ Code
In object oriented programming, the functionalities of a system result from the interactions (message exchanges) among the objects allocated by the system. While designing object ...
Paolo Tonella, Alessandra Potrich