Sciweavers

76 search results - page 7 / 16
» Linear-Time Ranking of Permutations
Sort
View
ECML
2004
Springer
13 years 10 months ago
Population Diversity in Permutation-Based Genetic Algorithm
Abstract. This paper presents an empirical study of population diversity measure and adaptive control of diversity in the context of a permutation-based algorithm for Traveling Sal...
Kenny Qili Zhu, Ziwei Liu
USS
2008
13 years 9 months ago
Coercion-Resistant Tallying for STV Voting
There are many advantages to voting schemes in which voters rank all candidates in order, rather than just choosing their favourite. However, these schemes inherently suffer from ...
Vanessa Teague, Kim Ramchen, Lee Naish
CSL
2005
Springer
14 years 12 days ago
Permutative Logic
Recent work establishes a direct link between the complexity of a linear logic proof in terms of the exchange rule and the topological complexity of its corresponding proof net, ex...
Jean-Marc Andreoli, Gabriele Pulcini, Paul Ruet
CORR
2006
Springer
138views Education» more  CORR 2006»
13 years 7 months ago
Tight Bounds on the Complexity of Recognizing Odd-Ranked Elements
Let S = s1, s2, s3, ..., sn be a given vector of n distinct real numbers. The rank of z R with respect to S is defined as the number of elements si S such that si z. We consider...
Shripad Thite
CORR
2010
Springer
135views Education» more  CORR 2010»
13 years 7 months ago
Constant-Weight Gray Codes for Local Rank Modulation
We consider the local rank-modulation scheme in which a sliding window going over a sequence of real-valued variables induces a sequence of permutations. The local rankmodulation, ...
Moshe Schwartz