Sciweavers

908 search results - page 159 / 182
» Heuristic Methods for Solving Job-Shop Scheduling Problems
Sort
View
GECCO
2007
Springer
179views Optimization» more  GECCO 2007»
15 years 5 months ago
XCSF with computed continuous action
Wilson introduced XCSF as a successor to XCS. The major development of XCSF is the concept of a computed prediction. The efficiency of XCSF in dealing with numerical input and con...
Trung Hau Tran, Cédric Sanza, Yves Duthen, ...
HPCN
1998
Springer
15 years 3 months ago
A Barotropic Global Ocean Model and its Parallel Implementation on Unstructured Grids
Unstructured grids can represent the complex geometry of the ocean basin with high delity. The lack of development tools supporting irregular grid problems discourages the use of ...
Hakan Öksüzoglu, A. G. M. van Hees
GECCO
2010
Springer
220views Optimization» more  GECCO 2010»
15 years 3 months ago
Interday foreign exchange trading using linear genetic programming
Foreign exchange (forex) market trading using evolutionary algorithms is an active and controversial area of research. We investigate the use of a linear genetic programming (LGP)...
Garnett Carl Wilson, Wolfgang Banzhaf
GECCO
2008
Springer
141views Optimization» more  GECCO 2008»
15 years 24 days ago
Potential fitness for genetic programming
We introduce potential fitness, a variant of fitness function that operates in the space of schemata and is applicable to tree-based genetic programing. The proposed evaluation ...
Krzysztof Krawiec, PrzemysBaw Polewski
COR
2010
166views more  COR 2010»
14 years 11 months ago
Variable neighbourhood decomposition search for 0-1 mixed integer programs
In this paper we propose a new hybrid heuristic for solving 0-1 mixed integer programs based on the principle of variable neighbourhood decomposition search. It combines variable ...
Jasmina Lazic, Saïd Hanafi, Nenad Mladenovic,...