867 search results - page 35 / 174 » The Generalized Maximum Coverage Problem |
119
Voted
SIGSOFT
2009
ACM
15 years 9 months ago
2009
ACM
An objective of unit testing is to achieve high structural coverage of the code under test. Achieving high structural coverage of object-oriented code requires desirable method-ca...
114
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: Maximum parsimony phylogenetic tree reconstruction from genetic variation data is a fundamental problem in computational genetics with many practical applications in p...
109
Voted
WAOA
2005
Springer
15 years 7 months ago
2005
Springer
Given a graph G = (V, E) with n vertices, m edges and maximum vertex degree ∆, the load distribution of a coloring ϕ : V → {red, blue} is a pair dϕ = (rϕ, bϕ), where rϕ i...
100
click to vote
BMCBI
2006
15 years 2 months ago
2006
Background: The aim of protein design is to predict amino-acid sequences compatible with a given target structure. Traditionally envisioned as a purely thermodynamic question, thi...
117
click to vote
COMPGEOM
1994
ACM
15 years 6 months ago
1994
ACM
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...