3889 search results - page 766 / 778 » The Use of Program Dependence Graphs in Software Engineering |
91
Voted
EMSOFT
2005
Springer
15 years 5 months ago
2005
Springer
We present AutoDVS, a dynamic voltage scaling (DVS) system for hand-held computers. Unlike extant DVS systems, AutoDVS distinguishes common, course-grain, program behavior and cou...
130
click to vote
CODES
2003
IEEE
15 years 5 months ago
2003
IEEE
One of the most challenging problems in high-level synthesis is how to quickly explore a wide range of design options to achieve high-quality designs. This paper presents an Integ...
120
click to vote
JAIR
2006
14 years 11 months ago
2006
A decision process in which rewards depend on history rather than merely on the current state is called a decision process with non-Markovian rewards (NMRDP). In decisiontheoretic...
123
click to vote
MBEES
2008
15 years 1 months ago
2008
: In this paper, we discuss adjustable coverage criteria and their combinations in model-based testing. We formalize coverage criteria and specify test goals using OCL. Then, we pr...
97
Voted
FSTTCS
2009
Springer
15 years 6 months ago
2009
Springer
A tournament T = (V, A) is a directed graph in which there is exactly one arc between every pair of distinct vertices. Given a digraph on n vertices and an integer parameter k, th...