Sciweavers

698 search results - page 10 / 140
» Fast functional simulation using branching programs
Sort
View
GECCO
2003
Springer
113views Optimization» more  GECCO 2003»
15 years 4 months ago
Predicate Expression Cost Functions to Guide Evolutionary Search for Test Data
Several researchers are using evolutionary search methods to search for test data with which to test a program. The fitness or cost function depends on the test goal but almost in...
Leonardo Bottaci
ICCAD
2009
IEEE
96views Hardware» more  ICCAD 2009»
14 years 9 months ago
PSTA-based branch and bound approach to the silicon speedpath isolation problem
The lack of good "correlation" between pre-silicon simulated delays and measured delays on silicon (silicon data) has spurred efforts on so-called silicon debug. The ide...
Sari Onaissi, Khaled R. Heloue, Farid N. Najm
VLSI
2007
Springer
15 years 5 months ago
Fast estimation of software energy consumption using IPI(Inter-Prefetch Interval) energy model
In this paper, we present the way of fast and accurate estimation of software energy consumption in off-the-shelf processor using IPI(Inter-Prefetch Interval) energy model. In ou...
Jungsoo Kim, Kyungsu Kang, Heejun Shim, Woong Hwan...
ISMVL
2000
IEEE
120views Hardware» more  ISMVL 2000»
15 years 4 months ago
Mod-p Decision Diagrams: A Data Structure for Multiple-Valued Functions
Multiple-valued decision diagrams (MDDs) give a way of approaching problems by using symbolic variables which are often more naturally associated with the problem statement than t...
Harald Sack, Elena Dubrova, Christoph Meinel
PLDI
1996
ACM
15 years 3 months ago
Fast, Effective Dynamic Compilation
Dynamic compilation enables optimizations based on the values of invariant data computed at run-time. Using the values of these runtime constants, a dynamic compiler can eliminate...
Joel Auslander, Matthai Philipose, Craig Chambers,...