The paper analyzes the regression problem for small and undersized sample. Two classical algorithms are compared: Simulated Annealing (SA) versus Repetitive Stochastic Guesstimation (RSG). An improved version of RSG is built and compared to the previous two algorithms. The author concludes that...

The optimal dispatching of cascade Hydro Power Plants is known as a complex optimization problem. In order to solve this problem the authors have applied an adapted differential evolution algorithm by using a fixed and dynamic population size. According to the dynamic population size, the...

Parallel sparse matrix-matrix multiplication algorithms (PSpGEMM) spend most of their running time on inter-process communication. In the case of distributed matrix-matrix multiplications, much of this time is spent on interchanging the partial results that are needed to calculate the final...

This article describes how as one of the hot parallel processors, the general-purpose graphics processing unit (GPU) has been widely adopted to accelerate various time-consuming algorithms. Dynamic programming (DP) optimization is a popular method to solve a particular class of complex problems....

The huge computations performed sequentially requires a lot of time for execution as on contrary to the concurrent implementation. Many problems are involved in the dense linear algebra operations the main focus for this work is for solving linear equations. The problem of solving linear...