The Collatz problem, widely known as the 3x + 1 problem, asks whether or not a certain simple iterative process halts on all inputs. We build on earlier work by J. H. Conway, and ...
Abstract. In this paper we consider a generalization of the edge dominating set (EDS) problem, in which each edge e needs to be covered be times and refer to this as the b-EDS prob...
We investigate the generalization performance of some learning problems in Hilbert functional Spaces. We introduce a notion of convergence of the estimated functional predictor to...
Several general purpose benchmark generators are now available in the literature. They are convenient tools in dynamic continuous optimization as they can produce test instances w...
Abdulnasser Younes, Paul H. Calamai, Otman A. Basi...
Abstract. We provide improved approximation algorithms for the minmax generalization problems considered by Du, Eppstein, Goodrich, and Lueker [1]. In min-max generalization proble...