1725 search results - page 140 / 345 » Relaxed genetic programming |
157
click to vote
WSC
2007
15 years 8 months ago
2007
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 ...
157
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
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...
187
click to vote
EUROGP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. We discuss here empirical comparation between model selection methods based on Linear Genetic Programming. Two statistical methods are compared: model selection based on ...
222
click to vote
CORR
2011
Springer
2011
Springer
On a linear programming approach to the discrete Willmore boundary value problem and generalizations
15 years 1 months ago
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...