Sciweavers

16404 search results - page 113 / 3281
» A set coverage problem
Sort
View
IDEAL
2004
Springer
15 years 8 months ago
The Application of K-Medoids and PAM to the Clustering of Rules
Abstract. Earlier research has resulted in the production of an ‘allrules’ algorithm for data-mining that produces all conjunctive rules of above given confidence and coverage...
Alan P. Reynolds, Graeme Richards, Victor J. Raywa...
KBSE
2008
IEEE
15 years 9 months ago
Predicting Effectiveness of Automatic Testing Tools
—Automatic white-box test generation is a challenging problem. Many existing tools rely on complex code analyses and heuristics. As a result, structural features of an input prog...
Brett Daniel, Marat Boshernitsan
DSD
2005
IEEE
116views Hardware» more  DSD 2005»
15 years 8 months ago
Validation of Embedded Systems Using Formal Method Aided Simulation
This paper proposes a validation approach, based on simulation, which addresses problems related to both state space explosion of formal methods and low coverage of informal metho...
Daniel Karlsson, Petru Eles, Zebo Peng
AGP
1997
IEEE
15 years 7 months ago
An Algorithm for Learning Abductive Rules
We propose an algorithm for learning abductive logic programs from examples. We consider the Abductive Concept Learning framework, an extension of the Inductive Logic Programming ...
Evelina Lamma, Paola Mello, Michela Milano, Fabriz...
GI
2008
Springer
15 years 4 months ago
A Self-Organized Localization-Free Clustering Approach for Redundancy Exploitation in Large Wireless Sensor Networks
: This paper investigates organization problems of large wireless sensor networks. In spite of their random deployment, nodes have to organize themselves as energy efficient as pos...
Jakob Salzmann