Sciweavers

220 search results - page 16 / 44
» Discovering Test Set Regularities in Relational Domains
Sort
View
STOC
2009
ACM
152views Algorithms» more  STOC 2009»
15 years 4 months ago
Green's conjecture and testing linear-invariant properties
A system of linear equations in p unknowns Mx = b is said to have the removal property if every set S ⊆ {1, . . . , n} which contains o(np− ) solutions of Mx = b can be turned...
Asaf Shapira
SAC
2009
ACM
15 years 2 months ago
Incremental board: a grid-based space for visualizing dynamic data sets
In Information Visualization, adding and removing data elements can strongly impact the underlying visual space. We introduce a chess board analogy for displaying (projecting) obj...
Roberto Pinho, Maria Cristina Ferreira de Oliveira...
AAAI
1990
14 years 11 months ago
A Proven Domain-Independent Scientific Function-Finding Algorithm
Programs such as Bacon, Abacus, Coper, Kepler and others are designed to find functional relationships of scientific significance in numerical data without relying on the deep dom...
Cullen Schaffer
INFOCOM
2010
IEEE
14 years 8 months ago
Pattern Mutation in Wireless Sensor Deployment
—In this paper, we study the optimal deployment pattern problem in wireless sensor networks (WSNs). We propose a new set of patterns, particularly when sensors’ communication r...
Xiaole Bai, Ziqiu Yun, Dong Xuan, Weijia Jia, Wei ...
ICST
2008
IEEE
15 years 4 months ago
On Combining Multi-formalism Knowledge to Select Models for Model Transformation Testing
Testing remains a major challenge for model transformation development. Test models that are used as test data for model transformations, are constrained by various sources of kno...
Sagar Sen, Benoit Baudry, Jean-Marie Mottu