We present a new algorithm for exact two-level logic optimization. It diiers from the classical approach; rather than generating the set of all prime implicants of a function, and then deriving a covering problem, we derive the covering problem directly and implicitly , and then generate only those primes involved in the covering problem. We represent a set of primes by the cube of their inters...

The problem of covering edges and vertices in a graph or in a hypergraph was motivated by a problem arising in the context of component assembly problem The problem is given a graph and a clique size k nd the minimum number of k cliques such that all edges and vertices of the graph are covered by included in the cliques This paper provides a collection of approximation algorithms for various cl...

For every fixed graph H, we determine the H-covering number of Kn, for all n > n0(H). We prove that if h is the number of edges of H, and gcd(H) = d is the greatest common divisor of the degrees of H, then there exists n0 = n0(H), such that for all n > n0, C(H,Kn) = d dn 2h dn− 1 d ee, unless d is even, n = 1 mod d and n(n− 1)/d+ 1 = 0 mod (2h/d), in which case C(H,Kn) = d ( n 2 ) h e+ 1. Our m...

This paper presents a new type of genetic algorithm for the set covering problem. It differs from previous evolutionary approaches first because it is an indirect algorithm, i.e. the actual solutions are found by an external decoder function. The genetic algorithm itself provides this decoder with permutations of the solution variables and other parameters. Second, it will be shown that results...

Bin-completion, a bin-oriented branch-and-bound approach, was recently shown to be promising for the bin packing problem. We propose several improvements to bin-completion that significantly improves search efficiency. We also show the generality of bin-completion for packing and covering problems involving multiple containers, and present bin-completion algorithms for the multiple knapsack, bi...

This paper presents an incremental method to solve hierarchies of constraints over nite domains, which borrows techniques developed in intelligent backtracking, and nds locally-predicate-better solutions. A prototype implementation of this method, IHCS, was written in C and can be integrated with diierent programming environments. In particular, with Prolog producing an instance of an HCLP lang...

A recent line of work has posed the design of the maximally permissive deadlock avoidance policy for a particular class of sequential resource allocation systems as a linear classification problem. It has also identified a connection between the classifier design problem addressed by it and the classical set-covering problem that has been studied in Operations Research and Computer Science. Thi...