Tiit Riismaa
Parallel and distributed simulation, Mathematical programming, Multi-level processing, Multi-level selection procedure, ordering of non-ordered sets
A method of description and optimization of the structure of multi-level selection procedure is presented. This procedure is a special case of a multi-level processing system. For general case the set of feasible structures for such class of systems is defined. The representation of this set is constructed in terms of the graph theory. For the reduced statement two types of variable parameters are defined: for the level size and for the relations of adjacent levels. A class of iteration methods is developed. Also a numerical method of local searching is developed. On each step of the iteration the calculation of the value of objective function is required only on some vertices of some kind of unit cube.
Important Links:
Go Back
