Variable selection consists in identifying a k-subset of a set of original variables that is optimal for a given criterion of adequate approximation to the whole data set. Several...
We study the efficiency of greedy algorithms with regard to redundant dictionaries in Hilbert spaces. We obtain upper estimates for the errors of the Pure Greedy Algorithm and th...
David L. Donoho, Michael Elad, Vladimir N. Temlyak...
The Job Scheduling with Cancellation problem is a variation of classical scheduling problems in which jobs can be cancelled while waiting for execution. In this paper we prove a t...
Feifeng Zheng, Francis Y. L. Chin, Stanley P. Y. F...
One of the important issues in the design of future generation high-speed networks is to provide differentiated services to different types of applications with various time const...
Electromagnetism-like algorithm (EM) is a population-based meta-heuristic which has been proposed to solve continuous problems effectively. In this paper, we present a new meta-h...