Sciweavers

248 search results - page 8 / 50
» A Simple Optimal Randomized Algorithm for Sorting on the PDM
Sort
View
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 7 months ago
On Sorting, Heaps, and Minimum Spanning Trees
Let A be a set of size m. Obtaining the first k m elements of A in ascending order can be done in optimal O(m + k log k) time. We present Incremental Quicksort (IQS), an algorith...
Gonzalo Navarro, Rodrigo Paredes
GECCO
2005
Springer
288views Optimization» more  GECCO 2005»
14 years 1 months ago
A comparison study between genetic algorithms and bayesian optimize algorithms by novel indices
Genetic Algorithms (GAs) are a search and optimization technique based on the mechanism of evolution. Recently, another sort of population-based optimization method called Estimat...
Naoki Mori, Masayuki Takeda, Keinosuke Matsumoto
CORR
2011
Springer
198views Education» more  CORR 2011»
13 years 2 months ago
Pattern matching in Lempel-Ziv compressed strings: fast, simple, and deterministic
Countless variants of the Lempel-Ziv compression are widely used in many real-life applications. This paper is concerned with a natural modification of the classical pattern match...
Pawel Gawrychowski
EUROGP
2001
Springer
105views Optimization» more  EUROGP 2001»
14 years 5 days ago
Adaptive Genetic Programming Applied to New and Existing Simple Regression Problems
Abstract. In this paper we continue our study on adaptive genetic programming. We use Stepwise Adaptation of Weights (saw) to boost performance of a genetic programming algorithm o...
Jeroen Eggermont, Jano I. van Hemert
TCS
2008
13 years 7 months ago
Comparing evolutionary algorithms to the (1+1)-EA
In this paper, we study the conditions in which the (1+1)-EA compares favorably to other evolutionary algorithms (EAs) in terms of fitness function distribution at given iteration...
Pavel A. Borisovsky, Anton V. Eremeev