2496 search results - page 48 / 500 » On covering by translates of a set |
ESA
2003
Springer
15 years 5 months ago
2003
Springer
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
DATE
2000
IEEE
15 years 3 months ago
2000
IEEE
The classical solving approach for two-level logic minimisation reduces the problem to a special case of unate covering and attacks the latter with a (possibly limited) branch-and...
101
click to vote
AAAI
2006
15 years 1 months ago
2006
In this paper, we describe an evolutionary approach to one of the most challenging problems in computer music: modeling the knowledge applied by a musician when performing a score...
103
click to vote
DAM
2010
14 years 12 months ago
2010
Given a set of m identical bins of size 1, the online input consists of a (potentially, infinite) stream of items in (0, 1]. Each item is to be assigned to a bin upon arrival. The ...
STOC
2002
ACM
16 years 4 days ago
2002
ACM
The Minimum Vertex Cover problem is the problem of, given a graph, finding a smallest set of vertices that touches all edges. We show that it is NP-hard to approximate this proble...