Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
Abstract. This paper presents a new Memetic Algorithm (MA) designed to compute near-optimal solutions for the covering array construction problem. It incorporates several distingui...
Evolution Strategies (ES) for black-box optimization of a function f : Rn → R are investigated. Namely, we consider the cumulative step-size adaptation (CSA) for the variance of...
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
Abstract-- The problem of optimally controlling the processing rate of tasks in Discrete Event Systems (DES) with hard real-time constraints has been solved in [9] under the assump...