1871 search results - page 205 / 375 » The Ephemeral Pairing Problem |
185
click to vote
ML
2006
ACM
15 years 6 months ago
2006
ACM
Bridge bidding is considered to be one of the most difficult problems for game-playing programs. It involves four agents rather than two, including a cooperative agent. In additio...
157
click to vote
TITS
2008
15 years 6 months ago
2008
Arrival sequencing and scheduling (ASS) at airports is an NP-hard problem. Much effort has been made to use permutation-representation-based genetic algorithms (GAs) to tackle this...
159
click to vote
CORR
2002
Springer
15 years 6 months ago
2002
Springer
an abstract optimization problem arising from biomolecular sequence analysis. For a sequence A of pairs (ai, wi) for i = 1, . . . , n and wi > 0, a segment A(i, j) is a consecu...
194
click to vote
CONSTRAINTS
1999
15 years 6 months ago
1999
We consider two approaches to the stable marriage problem: proposal algorithms and describing the stable matching polytope using linear inequalities. We illuminate the relationship...
143
click to vote
JMLR
2002
15 years 6 months ago
2002
In this paper, we discuss round robin classification (aka pairwise classification), a technique for handling multi-class problems with binary classifiers by learning one classifie...