Sciweavers

17760 search results - page 179 / 3552
» A Generalization of the Massey-Ding Algorithm
Sort
View
GECCO
2008
Springer
118views Optimization» more  GECCO 2008»
15 years 5 months ago
Deriving evaluation metrics for applicability of genetic algorithms to optimization problems
This paper aims to identify the missing links from theory of Genetic Algorithms (GAs) to application of GAs. Categories and Subject Descriptors: J.0 [Computer Applications]: Gener...
Hsinyi Jiang, Carl K. Chang
CJ
2008
82views more  CJ 2008»
15 years 4 months ago
An Overview of Techniques for Designing Parameterized Algorithms
A survey of the most important and general techniques in parameterized algorithm design is given. Each technique is explained with a meta-algorithm, its use is illustrated by exam...
Christian Sloper, Jan Arne Telle
GECCO
2000
Springer
114views Optimization» more  GECCO 2000»
15 years 7 months ago
Variable Length Genomes for Evolutionary Algorithms
A general variable length genome, called exG, is developed here to address the problems of fixed length representations in canonical evolutionary algorithms. Convergence aspects o...
C.-Y. Lee, E. K. Antonsson
FOCM
2006
50views more  FOCM 2006»
15 years 4 months ago
Online Learning Algorithms
In this paper, we study an online learning algorithm in Reproducing Kernel Hilbert Spaces (RKHS) and general Hilbert spaces. We present a general form of the stochastic gradient m...
Steve Smale, Yuan Yao
ALGORITHMICA
2005
99views more  ALGORITHMICA 2005»
15 years 4 months ago
Improved Approximation Algorithms for the Quality of Service Multicast Tree Problem
Abstract. The Quality of Service Multicast Tree Problem is a generalization of the Steiner tree problem which appears in the context of multimedia multicast and network design. In ...
Marek Karpinski, Ion I. Mandoiu, Alexander Olshevs...