7 search results - page 2 / 2 » Fixed-Parameter Tractability of the Maximum Agreement Supert... |
PPSN
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. Evolutionary algorithms have been shown to be very successful for a wide range of NP-hard combinatorial optimization problems. We investigate the NP-hard problem of compu...
AAIM
2008
Springer
14 years 23 days ago
2008
Springer
The Kemeny Score problem is central to many applications in the context of rank aggregation. Given a set of permutations (votes) over a set of candidates, one searches for a “con...