4903 search results - page 50 / 981 » The Set Covering Machine |
130
Voted
FSTTCS
2010
Springer
15 years 21 days ago
2010
Springer
Reachability and boundedness problems have been shown decidable for Vector Addition Systems with one zero-test. Surprisingly, place-boundedness remained open. We provide here a va...
121
Voted
ESA
2006
Springer
15 years 6 months ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...
110
Voted
APAL
2004
15 years 2 months ago
2004
Abstract. We start by studying the relationship between two invariants isolated by Shelah, the sets of good and approachable points. As part of our study of these invariants, we pr...
114
click to vote
SIGSOFT
2007
ACM
16 years 3 months ago
2007
ACM
The increasing complexity of configurable software systems creates a need for more intelligent sampling mechanisms to detect and locate failure-inducing dependencies between confi...
147
Voted
APPROX
2005
Springer
15 years 8 months ago
2005
Springer
We study the partial vertex cover problem. Given a graph G = (V, E), a weight function w : V → R+ , and an integer s, our goal is to cover all but s edges, by picking a set of v...