Previous Page 2

Displaying 21 – 26 of 26

Showing per page

An efficiency analysis of the parallel multitransputer implementation of two-level optimization algorithms

Jan Sadecki (2003)

International Journal of Applied Mathematics and Computer Science

The paper presents an approach to improve the efficiency of some two-level optimization algorithms by their implementation in parallel MIMD multiprocessor systems. Diagonal decomposition dynamic programming and parametric optimization methods are considered, and some concepts of their parallelization are discussed. Results regarding the implementation of computations in a parallel multitransputer system are presented. For the analysed problems, the obtained values of speedup are close to the theoretical...

Approximate dynamic programming based on high dimensional model representation

Miroslav Pištěk (2013)

Kybernetika

This article introduces an algorithm for implicit High Dimensional Model Representation (HDMR) of the Bellman equation. This approximation technique reduces memory demands of the algorithm considerably. Moreover, we show that HDMR enables fast approximate minimization which is essential for evaluation of the Bellman function. In each time step, the problem of parametrized HDMR minimization is relaxed into trust region problems, all sharing the same matrix. Finding its eigenvalue decomposition, we...

Currently displaying 21 – 26 of 26

Previous Page 2