We give an O(n lg n)-time algorithm for counting the number of inversions in a permutation on n elements. This improves a long-standing previous bound of O(n lg n/ lg lg n) that ...
In a Stackelberg pricing game a leader aims to set prices on a subset of a given collection of items, such as to maximize her revenue from a follower purchasing a feasible subset o...
Patrick Briest, Martin Hoefer, Luciano Gualà...
Recent text and speech processing applications such as speech mining raise new and more general problems related to the construction of language models. We present and describe in...
The data migration problem is to compute an efficient plan for moving data stored on devices in a network from one configuration to another. It is modeled by a transfer graph, wher...
This paper presents an Adaptive Genetic Algorithm (AGA) where selection pressure, crossover and mutation probabilities are adapted according to population diversity statistics. Th...