16404 search results - page 420 / 3281 » A set coverage problem |
191
click to vote
APWEB
2010
Springer
15 years 10 months ago
2010
Springer
Given a set of records, a threshold value t and a similarity function, we investigate the problem of finding all pairs of records such that similarity between each pair is above t....
151
click to vote
CEC
2005
IEEE
15 years 8 months ago
2005
IEEE
— This paper presents a technique for solving multiclass classification problems using a coevolutionary approach. There are m populations, where m is the number of classes. Indi...
161
click to vote
EOR
2010
15 years 6 months ago
2010
In the Attractive Traveling Salesman Problem the vertex set is partitioned into facility vertices and customer vertices. A maximum profit tour must be constructed on a subset of t...
176
click to vote
EOR
2007
15 years 6 months ago
2007
This paper presents a hybrid IP/CP algorithm for designing a double round robin schedule with a minimal number of breaks. Both mirrored and non-mirrored schedules with and without ...
174
click to vote
TCS
2008
15 years 6 months ago
2008
We investigate the complexity of finding Nash equilibria in which the strategy of each player is uniform on its support set. We show that, even for a restricted class of win-lose ...