Sciweavers

648 search results - page 41 / 130
» Simple Algorithms for a Weighted Interval Selection Problem
Sort
View
SODA
2010
ACM
202views Algorithms» more  SODA 2010»
14 years 5 months ago
Counting Inversions, Offline Orthogonal Range Counting, and Related Problems
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 ...
Timothy M. Chan, Mihai Patrascu
WINE
2009
Springer
93views Economy» more  WINE 2009»
14 years 2 months ago
On Stackelberg Pricing with Computationally Bounded Consumers
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à...
ACL
2003
13 years 9 months ago
Generalized Algorithms for Constructing Statistical Language Models
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...
Cyril Allauzen, Mehryar Mohri, Brian Roark
APPROX
2006
Springer
124views Algorithms» more  APPROX 2006»
13 years 11 months ago
Combinatorial Algorithms for Data Migration to Minimize Average Completion Time
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...
Rajiv Gandhi, Julián Mestre
GECCO
2008
Springer
144views Optimization» more  GECCO 2008»
13 years 8 months ago
Maintaining diversity through adaptive selection, crossover and mutation
This paper presents an Adaptive Genetic Algorithm (AGA) where selection pressure, crossover and mutation probabilities are adapted according to population diversity statistics. Th...
Brian McGinley, Fearghal Morgan, Colm O'Riordan