16404 search results - page 456 / 3281 » A set coverage problem |
172
click to vote
HEURISTICS
2007
15 years 6 months ago
2007
Abstract. The Maximum Diversity Problem (MDP) consists in identifying, in a population, a subset of elements, characterized by a set of attributes, that present the most diverse ch...
180
click to vote
SIAMCOMP
2008
15 years 6 months ago
2008
We consider the rooted orienteering problem: Given a set P of n points in the plane, a starting point r P, and a length constraint B, one needs to find a path starting from r tha...
154
click to vote
PRL
2006
15 years 6 months ago
2006
This paper addresses the supervised classification of remote-sensing images in problems characterized by relatively small-size training sets with respect to the input feature spac...
176
click to vote
TCS
2008
15 years 6 months ago
2008
We study the usefulness of lookahead in online server routing problems: if an online algorithm is not only informed about the requests released so far, but also has a limited abil...
162
click to vote
IJAIT
2010
15 years 5 months ago
2010
Many real world industrial applications involve finding a Hamiltonian path with minimum cost. Some instances that belong to this category are transportation routing problem, scan c...