16404 search results - page 526 / 3281 » A set coverage problem |
190
click to vote
MCS
2004
Springer
16 years 8 days ago
2004
Springer
The ECOC framework provides a powerful and popular method for solving multiclass problems using a multitude of binary classifiers. We had recently introduced the Binary Hierarchica...
137
click to vote
ICALP
2010
Springer
15 years 11 months ago
2010
Springer
Min Ones Constraint Satisfaction Problems, i.e., the task of finding a satisfying assignment with at most k true variables (Min Ones SAT(Γ)), can express a number of interesting ...
166
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
Abstract. We discuss a general approach to hybridize traditional construction heuristics for combinatorial optimization problems with numerical based evolutionary algorithms. There...
195
click to vote
HM
2007
Springer
15 years 10 months ago
2007
Springer
Optimization in sports is a field of increasing interest. A novel problem in sports management is the Referee Assignment Problem, in which a limited number of referees with differe...
200
click to vote
COCOON
2010
Springer
15 years 10 months ago
2010
Springer
Given a set of n strings of length L and a radius d, the closest string problem (CSP for short) asks for a string tsol that is within a Hamming distance of d to each of the given ...