Abstract. A new approach to develop parallel and distributed scheduling algorithms for multiprocessor systems is proposed. Its main innovation lies in evolving a decomposition of t...
Franciszek Seredynski, Jacek Koronacki, Cezary Z. ...
Abstract. Since minimum sum-of-squares clustering (MSSC) is an NPhard combinatorial optimization problem, applying techniques from global optimization appears to be promising for r...
Randomization is an efficient tool for global optimization. We here define a method which keeps : – the order 0 of evolutionary algorithms (no gradient) ; – the stochastic as...
We have developed an algorithm for reduction of search-space, called Domain Optimization Algorithm (DOA), applied to global optimization. This approach can efficiently eliminate ...
Vinicius Veloso de Melo, Alexandre C. B. Delbem, D...
Abstract— The design of root-Nyquist pulses with the maximum possible energy concentration of the power spectrum is a fundamental problem is communications engineering. Since the...
This paper introduces a modified version of the well known global optimization technique named line search method. The modifications refer to the way in which the direction and th...
This paper presents a simple, hybrid two phase global optimization algorithm called DE-PSO for solving global optimization problems. DE-PSO consists of alternating phases of Diffe...
Abstract. A new algorithm for interactive image segmentation is proposed. Besides the traditional appearance and gradient information, a new Generic Shape Prior (GSP) knowledge whi...
Abstract— The role of gradient estimation in global optimization is investigated. The concept of a regional gradient is introduced as a tool for analyzing and comparing different...