Abstract--The complexity of the selection procedure of a genetic algorithm that requires reordering, if we restrict the class of the possible fitness functions to varying fitness f...
Recently, several lower bound functions are proposed for solving the MAX-2-SAT problem optimally in a branch-and-bound algorithm. These lower bounds improve significantly the perf...
Abstract. “Computing the pessimism” means bounding the overestimation produced by an inclusion function. There are two important distinctions with classical error analysis. Fir...
In the paper, a new optimal learning algorithm for a neo-fuzzy neuron (NFN) is proposed. The algorithm is characteristic in that it provides online tuning of not only the synaptic...
In this paper, we propose a general framework for sparse semi-supervised learning, which concerns using a small portion of unlabeled data and a few labeled data to represent targe...