207 search results - page 1 / 42 » Run-Time Switching Between Total Order Algorithms |
EUROPAR
2006
Springer
13 years 8 months ago
2006
Springer
IPPS
2000
IEEE
13 years 9 months ago
2000
IEEE
1 The problem of sorting an intransitive total ordered set, a generalization of regular sorting, is considered. This generalized sorting is based on the fact that there exists a s...
IWPEC
2009
Springer
13 years 11 months ago
2009
Springer
We give improvements over fixed parameter tractable (FPT) algorithms to solve the Kemeny aggregation problem, where the task is to summarize a multi-set of preference lists, call...
INFOCOM
2002
IEEE
13 years 9 months ago
2002
IEEE
-- High performance packet switches frequently use a centralized scheduler (also known as an arbiter) to determine the configuration of a non-blocking crossbar. The scheduler often...
SODA
2001
ACM
13 years 6 months ago
2001
ACM
The syntenic distance between two genomes is given by the minimum number of fusions, fissions, and translocations required to transform one into the other, ignoring the order of g...