Sciweavers

627 search results - page 34 / 126
» How optimal is the genetic code
Sort
View
104
Voted
ICS
1999
Tsinghua U.
15 years 5 months ago
High-level semantic optimization of numerical codes
This paper presents a mathematical framework to exploit the semantic properties of matrix operations in loop-based numerical codes. The heart of this framework is an algebraic lan...
Vijay Menon, Keshav Pingali
88
Voted
GECCO
2008
Springer
155views Optimization» more  GECCO 2008»
15 years 1 months ago
Experiments with indexed FOR-loops in genetic programming
We investigated how indexed FOR-loops, such as the ones found in procedural programming languages, can be implemented in genetic programming. We use them to train programs that le...
Gayan Wijesinghe, Victor Ciesielski
ICCV
2009
IEEE
1735views Computer Vision» more  ICCV 2009»
16 years 5 months ago
Coded Aperture Pairs for Depth From Defocus
The classical approach to depth from defocus uses two images taken with circular apertures of different sizes. We show in this paper that the use of a circular aperture severely...
Changyin Zhou, Stephen Lin, Shree Nayar
GECCO
2004
Springer
105views Optimization» more  GECCO 2004»
15 years 6 months ago
Softening the Structural Difficulty in Genetic Programming with TAG-Based Representation and Insertion/Deletion Operators
In a series of papers [3-8], Daida et. al. highlighted the difficulties posed to Genetic Programming (GP) by the complexity of the structural search space, and attributed the probl...
Nguyen Xuan Hoai, Robert I. McKay
GECCO
2006
Springer
161views Optimization» more  GECCO 2006»
15 years 4 months ago
Instance similarity and the effectiveness of case injection in a genetic algorithm for binary quadratic programming
When an evolutionary algorithm addresses a sequence of instances of the same problem, it can seed its population with solutions that it found for previous instances. This techniqu...
Jason Amunrud, Bryant A. Julstrom