Sciweavers

1725 search results - page 140 / 345
» Relaxed genetic programming
Sort
View
79
Voted
LICS
1998
IEEE
15 years 3 months ago
The Horn Mu-calculus
The Horn
Witold Charatonik, David A. McAllester, Damian Niw...
WSC
2007
15 years 1 months ago
Optimal scheduling of probabilistic repetitive projects using completed unit and genetic algorithms
In this paper we introduce the completed unit algorithm (CU-AL), a probabilistic scheduling methodology for repetitive projects. The algorithm has two main advantages, simplicity ...
Chachrist Srisuwanrat, Photios G. Ioannou
GECCO
2004
Springer
147views Optimization» more  GECCO 2004»
15 years 4 months ago
A Demonstration of Neural Programming Applied to Non-Markovian Problems
Genetic programming may be seen as a recent incarnation of a long-held goal in evolutionary computation: to develop actual computational devices through evolutionary search. Geneti...
Gabriel Catalin Balan, Sean Luke
EUROGP
2009
Springer
149views Optimization» more  EUROGP 2009»
15 years 5 months ago
Adaptation, Performance and Vapnik-Chervonenkis Dimension of Straight Line Programs
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
José Luis Montaña, César Luis...
135
Voted
CORR
2011
Springer
220views Education» more  CORR 2011»
14 years 5 months ago
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
We consider the problem of finding (possibly non connected) discrete surfaces spanning a finite set of discrete boundary curves in the three-dimensional space and minimizing (glo...
Thomas Schoenemann, Simon Masnou, Daniel Cremers