1725 search results - page 160 / 345 » Relaxed genetic programming |
158
Voted
CEC
2005
IEEE
15 years 5 months ago
2005
IEEE
The problem of scheduling a parallel program given by a Directed Acyclic Graph (DAG) of tasks is a well-studied area. We present a new approach which employs Differential Evolution...
122
Voted
ICES
2010
Springer
15 years 1 months ago
2010
Springer
In this paper, we propose a new modification of Cartesian Genetic Programming (CGP) that enables to optimize digital circuits more significantly than standard CGP. We argue that co...
126
Voted
COCOA
2007
Springer
15 years 9 months ago
2007
Springer
We define a fundamental domain for a linear programming relaxation of a combinatorial integer program which is symmetric under a group action. We then describe a straightforward w...
141
Voted
MP
2006
15 years 3 months ago
2006
In classical two-stage stochastic programming the expected value of the total costs is minimized. Recently, mean-risk models - studied in mathematical finance for several decades -...
132
Voted
ESA
2006
Springer
15 years 7 months ago
2006
Springer
A popular approach in combinatorial optimization is to model problems as integer linear programs. Ideally, the relaxed linear program would have only integer solutions, which happ...