Sciweavers

Share
188 search results - page 2 / 38
» Analysis and extension of the Inc* on the satisfiability tes...
Sort
View
JCSS
2007
63views more  JCSS 2007»
8 years 4 months ago
Holistic analysis of asynchronous real-time transactions with earliest deadline scheduling
In distributed real-time systems, an application is often modeled as a set of real-time transactions, where each transaction is a chain of precedence-constrained tasks. Each task ...
Rodolfo Pellizzoni, Giuseppe Lipari
SYNTHESE
2008
84views more  SYNTHESE 2008»
8 years 4 months ago
How experimental algorithmics can benefit from Mayo's extensions to Neyman-Pearson theory of testing
Although theoretical results for several algorithms in many application domains were presented during the last decades, not all algorithms can be analyzed fully theoretically. Exp...
Thomas Bartz-Beielstein
ARC
2008
Springer
95views Hardware» more  ARC 2008»
8 years 6 months ago
The Instruction-Set Extension Problem: A Survey
Over the last years, we have witnessed the increased use of Application-Specific Instruction-Set Processors (ASIPs). These ASIPs are processors that have a customizable instruction...
Carlo Galuzzi, Koen Bertels
ICCAD
1996
IEEE
112views Hardware» more  ICCAD 1996»
8 years 8 months ago
GRASP - a new search algorithm for satisfiability
This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed searchp...
João P. Marques Silva, Karem A. Sakallah
HVC
2005
Springer
97views Hardware» more  HVC 2005»
8 years 10 months ago
An Extensible Open-Source Compiler Infrastructure for Testing
Testing forms a critical part of the development process for large-scale software, and there is growing need for automated tools that can read, represent, analyze, and transform th...
Daniel J. Quinlan, Shmuel Ur, Richard W. Vuduc
books