1723 search results - page 150 / 345 » Cycling in linear programming problems |
ICLP
1997
Springer
15 years 2 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
100
click to vote
GECCO
2007
Springer
15 years 1 months ago
2007
Springer
The Probabilistic Adaptive Mapping Developmental Genetic Programming (PAM DGP) algorithm that cooperatively coevolves a population of adaptive mappings and associated genotypes is...
COR
2010
14 years 10 months ago
2010
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 ...
CEC
2010
IEEE
14 years 1 months ago
2010
IEEE
— If a population of programs evolved not for a few hundred generations but for a few hundred thousand or more, could it generate more interesting behaviours and tackle more comp...
PPL
2000
14 years 9 months ago
2000
In this paper we analyze the computational power of random geometric networks in the presence of random (edge or node) faults considering several important network parameters. We ...