16404 search results - page 182 / 3281 » A set coverage problem |
120
click to vote
IWOCA
2009
Springer
15 years 10 months ago
2009
Springer
A vertex subset D of a graph G is a dominating set if every vertex of G is either in D or is adjacent to a vertex in D. The paired-domination problem on G asks for a minimum-cardi...
143
click to vote
JDA
2008
15 years 3 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...
114
Voted
ICML
2004
IEEE
15 years 9 months ago
2004
IEEE
We consider the problem of eliminating redundant Boolean features for a given data set, where a feature is redundant if it separates the classes less well than another feature or ...
131
click to vote
EMO
2009
Springer
15 years 8 months ago
2009
Springer
Abstract. Most existing evolutionary approaches to multiobjective optimization aim at finding an appropriate set of compromise solutions, ideally a subset of the Pareto-optimal se...
141
Voted
AI
2001
Springer
15 years 8 months ago
2001
Springer
In recent years, interval constraint-based solvers have shown their ability to efficiently solve challenging non-linear real constraint problems. However, most of the working syst...