Sciweavers

239 search results - page 5 / 48
» Data Abstraction and Constraint Solving for Conformance Test...
Sort
View
ICML
2008
IEEE
14 years 8 months ago
Efficiently solving convex relaxations for MAP estimation
The problem of obtaining the maximum a posteriori (map) estimate of a discrete random field is of fundamental importance in many areas of Computer Science. In this work, we build ...
M. Pawan Kumar, Philip H. S. Torr
TAP
2008
Springer
102views Hardware» more  TAP 2008»
13 years 7 months ago
A Logic-Based Approach to Combinatorial Testing with Constraints
Abstract. Usage of combinatorial testing is wide spreading as an effective technique to reveal unintended feature interaction inside a given system. To this aim, test cases are con...
Andrea Calvagna, Angelo Gargantini
CORR
2010
Springer
144views Education» more  CORR 2010»
13 years 7 months ago
CLP-based protein fragment assembly
Abstract. The paper investigates a novel approach, based on Constraint Logic Programming (CLP), to predict the 3D conformation of a protein via fragments assembly. The fragments ar...
Alessandro Dal Palù, Agostino Dovier, Feder...
ISMIS
2011
Springer
12 years 10 months ago
Data Access Paths in Processing of Sets of Frequent Itemset Queries
Abstract. Frequent itemset mining can be regarded as advanced database querying where a user specifies the dataset to be mined and constraints to be satisfied by the discovered i...
Piotr Jedrzejczak, Marek Wojciechowski
KBSE
1997
IEEE
13 years 11 months ago
Genetic Algorithms for Dynamic Test Data Generation
In software testing, it is often desirable to find test inputs that exercise specific program features. To find these inputs by hand is extremely time-consuming, especially whe...
Christoph C. Michael, Gary McGraw, Michael Schatz,...