We consider multilevel set-covering models for diagnostic reasoning: though a lot of work has been done in this field, knowledge acquisition efforts have been investigated only insufficiently. We will show how set-covering models can be build incrementally and how they can be refined by knowledge enhancements or representational extensions. All these extensions have a primary characteristic: th...

This paper describes new set covering algorithms associated with the DISCRETE edit system. DISCRETE is based on the Fellegi-Holt model (JASA 1976) of editing. A new implicit-edit generation algorithm replaces algorithms of Garfinkel, Kunnathur, and Liepins (Operations Research 1986) and Winkler (1995). The new set-covering algorithms correctly generate implicit edits for large subclasses and re...

In this case study we consider the set covering problem, the classical operations research problem of covering the rows of a zero-one matrix by a subset of the columns at minimum cost. We outline a genetic-algorithm-based heuristic for the problem. The key features of this genetic algorithm are a binary representation, drawn naturally from a zero-one formulation of the problem, a new crossover ...

not submitted. Designing and building synthetic signal transduction circuitry in yeast Stephen Checkley Manchester The yeast Saccharomyces cerevisiae possesses an intracellular signal transduction pathway enabling this organism to initiate a developmental response upon detection of a peptide mating pheromone. This developmental response is the focus of this study. The project aims to modify the...

We introduce a parameterized version of set cover that generalizes several previously studied problems. Given a ground set V and a collection of subsets Si of V , a feasible solution is a partition of V such that each subset of the partition is included in one of the Si. The problem involves maximizing the mean subset size of the partition, where the mean is the generalized mean of parameter p,...

Let AR,q denote a family of covering codes, in which the covering radius R and the size q of the underlying Galois field are fixed, while the code length tends to infinity. The construction of families with small asymptotic covering densities is a classical problem in the area Covering Codes. In this paper, infinite sets of families AR,q, where R is fixed but q ranges over an infinite set of pr...

To solve the Set Covering Problem we will use a metaheuristic Fireworks Algorithm inspired by the fireworks explosion. Through the observation of the way that fireworks explode is much similar to the way that an individual searches the optimal solution in swarm. Fireworks algorithm (FWA) consists of four parts, i.e., the explosion operator, the mutation operator, the mapping rule and selection ...

We study on-line models for the set-covering problem in which items from a ground set arrive one by one and with any such item c, the list of names of sets that contain it in the final instance is also presented possibly together with some information regarding the content of such sets. A decision maker has to select which set, among the sets containing c, has to be put in the solution in order...