Sciweavers

911 search results - page 36 / 183
» Kolmogorov Complexity Cores
Sort
View
UML
1999
Springer
15 years 6 months ago
Core Meta-Modelling Semantics of UML: The pUML Approach
Abstract. The current UML semantics documentation has made a signi cant step towards providing a precise description of the UML. However, at present the semantic model it proposes ...
Andy Evans, Stuart Kent
DELTA
2004
IEEE
15 years 5 months ago
Scan Test of IP Cores in an ATE Environment
Manufacturing test of chips made of multiple IP cores requires different techniques if ATE is used. As scan chains are commonly used as access paths to the DUT, ATE architectures ...
Luca Schiano, Yong-Bin Kim, Fabrizio Lombardi
CORR
2010
Springer
135views Education» more  CORR 2010»
15 years 2 months ago
Information Distance
While Kolmogorov complexity is the accepted absolute measure of information content in an individual finite object, a similarly absolute notion is needed for the information distan...
Charles H. Bennett, Péter Gács, Ming...
VLSI
2005
Springer
15 years 7 months ago
Modeling the Traffic Effect for the Application Cores Mapping Problem onto NoCs
This work addresses the problem of application mapping in networks-on-chip (NoCs) having as goal to minimize the total dynamic energy consumption of a complex system-on-a-chip (So...
César A. M. Marcon, José Carlos S. P...
FOCS
1999
IEEE
15 years 6 months ago
Boosting and Hard-Core Sets
This paper connects two fundamental ideas from theoretical computer science: hard-core set construction, a type of hardness amplification from computational complexity, and boosti...
Adam Klivans, Rocco A. Servedio