945 search results - page 48 / 189 » Incremental Branching Programs |
MICRO
2002
IEEE
14 years 19 days ago
2002
IEEE
This paper presents Vacuum Packing, a new approach to profile-based program optimization. Instead of using traditional aggregate or summarized execution profile weights, this ap...
KBSE
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
POPL
1994
ACM
13 years 11 months ago
1994
ACM
In this paper we present techniques to nd subsets of nodes of a owgraph that satisfy the followingproperty: A test set that exercises all nodes in a subset exercises allnodes in t...
DISOPT
2008
13 years 7 months ago
2008
We introduce a general technique to create an extended formulation of a mixed-integer program. We classify the integer variables into blocks, each of which generates a finite set ...
CP
2009
Springer
14 years 8 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...