Sciweavers

4299 search results - page 449 / 860
» Concurrent Test Generation
Sort
View
ICML
2008
IEEE
16 years 7 months ago
Fast estimation of first-order clause coverage through randomization and maximum likelihood
In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Filip Zelezný, Ondrej Kuzelka
155
Voted
PERCOM
2009
ACM
16 years 6 months ago
DiaSim: A Parameterized Simulator for Pervasive Computing Applications
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...
Wilfried Jouve, Julien Bruneau, Charles Consel
VLSID
2002
IEEE
83views VLSI» more  VLSID 2002»
16 years 6 months ago
Identifying Redundant Wire Replacements for Synthesis and Verification
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...
Katarzyna Radecka, Zeljko Zilic
DCC
2006
IEEE
16 years 5 months ago
Roux-type constructions for covering arrays of strengths three and four
A covering array CA(N; t, k, v) is an N ? k array such that every N ? t sub-array contains all t-tuples from v symbols at least once, where t is the strength of the array. Coverin...
Charles J. Colbourn, Sosina Martirosyan, Tran van ...
ALT
2005
Springer
16 years 3 months ago
An Analysis of the Anti-learning Phenomenon for the Class Symmetric Polyhedron
This paper deals with an unusual phenomenon where most machine learning algorithms yield good performance on the training set but systematically worse than random performance on th...
Adam Kowalczyk, Olivier Chapelle