Sciweavers

5263 search results - page 275 / 1053
» Optimization with Extremal Dynamics
Sort
View
ISAAC
2010
Springer
243views Algorithms» more  ISAAC 2010»
15 years 4 months ago
Lower Bounds for Howard's Algorithm for Finding Minimum Mean-Cost Cycles
Howard's policy iteration algorithm is one of the most widely used algorithms for finding optimal policies for controlling Markov Decision Processes (MDPs). When applied to we...
Thomas Dueholm Hansen, Uri Zwick
244
Voted
CPM
2009
Springer
183views Combinatorics» more  CPM 2009»
15 years 4 months ago
Permuted Longest-Common-Prefix Array
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
Juha Kärkkäinen, Giovanni Manzini, Simon...
CORR
2011
Springer
134views Education» more  CORR 2011»
15 years 1 months ago
Robust Line Planning in case of Multiple Pools and Disruptions
Abstract. We consider the line planning problem in public transportation, under a robustness perspective. We present a mechanism for robust line planning in the case of multiple li...
Apostolos Bessas, Spyros C. Kontogiannis, Christos...
TIT
2010
144views Education» more  TIT 2010»
15 years 26 days ago
Lossy source compression using low-density generator matrix codes: analysis and algorithms
We study the use of low-density generator matrix (LDGM) codes for lossy compression of the Bernoulli symmetric source. First, we establish rigorous upper bounds on the average dist...
Martin J. Wainwright, Elitza N. Maneva, Emin Marti...
ICASSP
2011
IEEE
14 years 10 months ago
Fixed point iteration for max-min sir balancing with general interference functions
This paper studies the convergence of a fixed point iteration algorithm for the problem of max-min signal-to-interference ratio (SIR) balancing. Differently from the existing wor...
Nikola Vucic, Martin Schubert