1723 search results - page 26 / 345 » Cycling in linear programming problems |
ECP
1997
Springer
14 years 1 months ago
1997
Springer
In this paper we describe SINERGY, which is a highly parallelizable, linear planning system that is based on the genetic programming paradigm. Rather than reasoning about the world...
SIAMJO
2008
13 years 9 months ago
2008
We propose a new iterative approach for solving linear programs over convex cones. Assuming that Slaters condition is satisfied, the conic problem is transformed to the minimizatio...
CORR
2007
Springer
13 years 9 months ago
2007
Springer
Separable convex optimization problems with linear ascending inequality and equality constraints are addressed in this paper. An algorithm that explicitly characterizes the optimum...
CEC
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper presents a modularization strategy for linear genetic programming (GP) based on a substring compression/substitution scheme. The purpose of this substitution scheme is t...
IJCNN
2006
IEEE
14 years 3 months ago
2006
IEEE
— Area Under the ROC Curve (AUC) is often used to evaluate ranking performance in binary classification problems. Several researchers have approached AUC optimization by approxi...