Sciweavers

1563 search results - page 54 / 313
» Performance comparison of memetic algorithms
Sort
View
SPIRE
2005
Springer
14 years 2 months ago
Experimental Analysis of a Fast Intersection Algorithm for Sorted Sequences
Abstract. This work presents an experimental comparison of intersection algorithms for sorted sequences, including the recent algorithm of Baeza-Yates. This algorithm performs on a...
Ricardo A. Baeza-Yates, Alejandro Salinger
ICIP
2009
IEEE
14 years 10 months ago
New Results On Performance Analysis Of Super-resolution Image Reconstruction
In this paper, we present new results in performance analysis of super-resolution (SR) image reconstruction. We investigate bounds on the improvement in resolution that can be ach...
VLDB
1991
ACM
145views Database» more  VLDB 1991»
14 years 10 days ago
A Taxonomy and Performance Model of Data Skew Effects in Parallel Joins
Recent work on parallel joins and data skew has concentrated on algorithm design without considering the causes and chara.cteristics of data. skew itself. Existming ana.lyt,ic mod...
Christopher B. Walton, Alfred G. Dale, Roy M. Jene...
ISCI
1998
193views more  ISCI 1998»
13 years 8 months ago
A Parallel Implementation of Genetic Programming that Achieves Super-Linear Performance
: This paper describes the successful parallel implementation of genetic programming on a network of processing nodes using the transputer architecture. With this approach, researc...
David Andre, John R. Koza
AAAI
2007
13 years 11 months ago
Temporal Difference and Policy Search Methods for Reinforcement Learning: An Empirical Comparison
Reinforcement learning (RL) methods have become popular in recent years because of their ability to solve complex tasks with minimal feedback. Both genetic algorithms (GAs) and te...
Matthew E. Taylor, Shimon Whiteson, Peter Stone