In inductive logic programming, subsumption is a widely used coverage test. Unfortunately, testing -subsumption is NP-complete, which represents a crucial efficiency bottleneck fo...
Abstract--Pervasive computing applications involve both software concerns, like any software system, and integration concerns, for the constituent networked devices of the pervasiv...
We propose the redundancy identification of wire replacement faults. The solutions rely on the satisfiability (SAT) formulation of redundancy identification, augmented with the me...
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 ...
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...