16404 search results - page 141 / 3281 » A set coverage problem |
122
click to vote
ECCC
2006
15 years 3 months ago
2006
Under the assumption that NP does not have p-measure 0, we investigate reductions to NP-complete sets and prove the following: (1) Adaptive reductions are more powerful than nonad...
133
Voted
DIS
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we consider finding a small set of substring patterns which classifies the given documents well. We formulate the problem as 1 norm soft margin optimization problem ...
121
click to vote
LATA
2009
Springer
15 years 10 months ago
2009
Springer
We study the effects of faulty data on NP-hard sets. We consider hard sets for several polynomial time reductions, add corrupt data and then analyze whether the resulting sets are...
139
Voted
HEURISTICS
2008
15 years 1 months ago
2008
Since their beginning in constraint programming, set solvers have been applied to a wide range of combinatorial search problems, such as bin-packing, set partitioning, circuit desi...
105
Voted
ICCNMC
2005
Springer
15 years 8 months ago
2005
Springer
— The minimum disc cover set can be used to construct the dominating set on the fly for energy-efficient communications in mobile ad hoc networks. The approach used to compute ...