Sciweavers

6315 search results - page 89 / 1263
» Approximating Solution Structure
Sort
View
EVOW
2010
Springer
16 years 1 months ago
Enhancing Genetic Algorithms by a Trie-Based Complete Solution Archive
Genetic algorithms (GAs) share a common weakness with most other metaheuristics: Candidate solutions are in general revisited multiple times, lowering diversity and wasting preciou...
Günther R. Raidl, Bin Hu
STACS
2005
Springer
15 years 11 months ago
Approximate Range Mode and Range Median Queries
Abstract. We consider data structures and algorithms for preprocessing a labelled list of length n so that, for any given indices i and j we can answer queries of the form: What is...
Prosenjit Bose, Evangelos Kranakis, Pat Morin, Yih...
GECCO
2004
Springer
15 years 11 months ago
Multi-branches Genetic Programming as a Tool for Function Approximation
This work presents a performance analysis of a Multi-Branches Genetic Programming (MBGP) approach applied in symbolic regression (e.g. function approximation) problems. Genetic Pro...
Katya Rodríguez-Vázquez, Carlos Oliv...
JSCIC
2010
145views more  JSCIC 2010»
15 years 29 days ago
Interior Penalty Continuous and Discontinuous Finite Element Approximations of Hyperbolic Equations
In this paper we present the continuous and discontinuous Galerkin methods in a unified setting for the numerical approximation of the transport dominated advection-reaction equati...
Erik Burman, Alfio Quarteroni, Benjamin Stamm
ICASSP
2011
IEEE
14 years 10 months ago
Empirical divergence maximization for quantizer design: An analysis of approximation error
Empirical divergence maximization is an estimation method similar to empirical risk minimization whereby the Kullback-Leibler divergence is maximized over a class of functions tha...
Michael A. Lexa