Sciweavers

25 search results - page 3 / 5
» On-Line Variable Sized Covering
Sort
View
ACTA
2007
92views more  ACTA 2007»
13 years 6 months ago
Solving #SAT using vertex covers
Abstract We propose an exact algorithm for counting the models of propositional formulas in conjunctive normal form (CNF). Our algorithm is based on the detection of strong backdoo...
Naomi Nishimura, Prabhakar Ragde, Stefan Szeider
COMPSAC
2003
IEEE
13 years 11 months ago
Variable Strength Interaction Testing of Components
Complete interaction testing of components is too costly in all but the smallest systems. Yet component interactions are likely to cause unexpected faults. Recently, design of exp...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
CP
2000
Springer
13 years 10 months ago
Boosting Search with Variable Elimination
Abstract. Variable elimination is the basic step of Adaptive Consistency 4 . It transforms the problem into an equivalent one, having one less variable. Unfortunately, there are ma...
Javier Larrosa
ICSE
2003
IEEE-ACM
14 years 6 months ago
Constructing Test Suites for Interaction Testing
Software system faults are often caused by unexpected interactions among components. Yet the size of a test suite required to test all possible combinations of interactions can be...
Myra B. Cohen, Peter B. Gibbons, Warwick B. Mugrid...
ICIP
2005
IEEE
14 years 7 months ago
Motion-compensation using variable-size block-matching with binary partition trees
A new approach to Variable Size Block Matching is proposed, based on the binary partitioning of blocks. If a particular block does not allow for accurate motion compensation, then...
Marc Servais, Theodore Vlachos, Thomas Davies