16404 search results - page 749 / 3281 » A set coverage problem |
188
click to vote
HM
2007
Springer
16 years 1 months ago
2007
Springer
The connected facility location (ConFL) problem generalizes the facility location problem and the Steiner tree problem in graphs. Given a graph G = (V, E), a set of customers D ⊆...
202
click to vote
ALENEX
2009
15 years 5 months ago
2009
We consider the problem of finding a ranking of a set of elements that is "closest to" a given set of input rankings of the elements; more precisely, we want to find a p...
317
click to vote
Publication
This report will consider one recent method of solving the image segmentation problem,
namely, the Active Contour Without Edges method. This method utilizes the level set
techniq...
300
click to vote
CP
2009
Springer
16 years 8 months ago
2009
Springer
The length-lex representation for set variables orders all subsets of a given universe of values according to cardinality and lexicography. To achieve length-lex bounds consistency...
177
click to vote
AAIM
2007
Springer
16 years 1 months ago
2007
Springer
The Generalized Maximum Dispersion problem asks for a partition of a given graph into p vertex-disjoint sets, each of them having at most k vertices. The goal is to maximize the to...