Sciweavers

1157 search results - page 151 / 232
» Solving iterated functions using genetic programming
Sort
View
CEC
2008
IEEE
15 years 10 months ago
Increasing rule extraction accuracy by post-processing GP trees
—Genetic programming (GP), is a very general and efficient technique, often capable of outperforming more specialized techniques on a variety of tasks. In this paper, we suggest ...
Ulf Johansson, Rikard König, Tuve Löfstr...
120
Voted
ITS
1992
Springer
124views Multimedia» more  ITS 1992»
15 years 7 months ago
Knowledge Base Compilation and the Language Design Game
: The ProgramCritic is a system designed to analyze and critique students' computer programs. After analyzing a program, the ProgramCritic provides the student with a list of ...
Warren Sack
167
Voted
CORR
2011
Springer
215views Education» more  CORR 2011»
14 years 7 months ago
Lasserre Hierarchy, Higher Eigenvalues, and Approximation Schemes for Quadratic Integer Programming with PSD Objectives
We present an approximation scheme for optimizing certain Quadratic Integer Programming problems with positive semidefinite objective functions and global linear constraints. Thi...
Venkatesan Guruswami, Ali Kemal Sinop
147
Voted
CG
2002
Springer
15 years 3 months ago
Gentropy: evolving 2D textures
Gentropy is a genetic programming system that evolves two-dimensional procedural textures. It synthesizes textures by combining mathematical and image manipulation functions into ...
Andrea L. Wiens, Brian J. Ross
131
Voted
ISNN
2005
Springer
15 years 9 months ago
One-Bit-Matching ICA Theorem, Convex-Concave Programming, and Combinatorial Optimization
Recently, a mathematical proof is obtained in (Liu, Chiu, Xu, 2004) on the so called one-bit-matching conjecture that all the sources can be separated as long as there is an one-to...
Lei Xu