We present new deterministic algorithms for several cases of the maximum rank matrix completion problem (for short matrix completion), i.e. the problem of assigning values to the ...
Abstract- Ant algorithms have generated significant research interest within the search/optimisation community in recent years. Hyperheuristic research is concerned with the devel...
Edmund K. Burke, Graham Kendall, Dario Landa Silva...
Abstract. We derive upper and lower bounds for some statistical estimation problems. The upper bounds are established for the Gibbs algorithm. The lower bounds, applicable for all ...
In this paper the potential of GP-generated symbolic regression for alleviating multicollinearity problems in multiple regression is presented with a case study in an industrial s...
Abstract. We consider a generalization of the classical max-cut problem where two objective functions are simultaneously considered. We derive some theorems on the existence and th...
Eric Angel, Evripidis Bampis, Laurent Gourvè...