Sciweavers

3663 search results - page 476 / 733
» Problems in the ontology of computer programs
Sort
View
DAC
2005
ACM
15 years 8 months ago
Multi-frequency wrapper design and optimization for embedded cores under average power constraints
This paper presents a new method for designing test wrappers for embedded cores with multiple clock domains. By exploiting the use of multiple shift frequencies, the proposed meth...
Qiang Xu, Nicola Nicolici, Krishnendu Chakrabarty
NIPS
2008
15 years 8 months ago
Clusters and Coarse Partitions in LP Relaxations
We propose a new class of consistency constraints for Linear Programming (LP) relaxations for finding the most probable (MAP) configuration in graphical models. Usual cluster-base...
David Sontag, Amir Globerson, Tommi Jaakkola
AMAI
2007
Springer
15 years 6 months ago
Decision procedures for extensions of the theory of arrays
The theory of arrays, introduced by McCarthy in his seminal paper “Toward a mathematical science of computation”, is central to Computer Science. Unfortunately, the theory alo...
Silvio Ghilardi, Enrica Nicolini, Silvio Ranise, D...
RTS
2000
143views more  RTS 2000»
15 years 6 months ago
Fast and Precise WCET Prediction by Separated Cache and Path Analyses
Precise run-time prediction suffers from a complexity problem when doing an integrated analysis. This problem is characterised by the conflict between an optimal solution and the c...
Henrik Theiling, Christian Ferdinand, Reinhard Wil...
JMMA
2002
90views more  JMMA 2002»
15 years 6 months ago
Implicit Convex Polygons
Convex polygons in the plane can be defined explicitly as an ordered list of vertices, or given implicitly, for example by a list of linear constraints. The latter representation h...
Francisco Gómez, Ferran Hurtado, Suneeta Ra...