Journal:Informatica
Volume 8, Issue 4 (1997), pp. 583–598
Abstract
In the present paper, a method of global optimisation (structure adapted search) is proposed. It uses the grid of trial points which are more uniformly distributed for the projections on variables or their groups that make more influence.
The paper uses a set of test models to demonstrate the merit of the approaches. The efficiency of structure adapted search as compared to the random search is investigated. The results of using the new approach may be treated as a success.
Journal:Informatica
Volume 7, Issue 3 (1996), pp. 337–348
Abstract
In the application of Dantzig–Wolfe decomposition to block-angular linear programming problems with R natural blocks. it is possible to have from 1 to R subproblems structurally while solving all R independent subproblems computationally. Early literature on the topic was inconclusive regarding the relative merits of such formulations. This paper attempts clarification by characterizing the significance of the degree of decomposition as well as presenting extensive empirical results.
Journal:Informatica
Volume 5, Issues 1-2 (1994), pp. 43–54
Abstract
A development of algorithms and writing of programs are considered as closely related but not identical parts of computer programming. Some differences between them are important for learning of computer programming, in particular, in distance learning. These differences are identified and discussed from the pedagogical point of view. The arguments for the selection of pedagogical based and cost-effective delivery modes in the case of distance learning are investigated. Practical examples supporting theoretical arguments are given on the activities of Lithuanian schools.
Journal:Informatica
Volume 2, Issue 4 (1991), pp. 473–477
Abstract
The role of an interface between an algorithm and its environment for school students is discussed. The motivation of the use of Pascal functions and procedures instead of commonly used programs in the first lessons of programming is presented. The main features of an interpreter of algorithms (Pascal functions and procedures) implemented on school computer are presented.
Journal:Informatica
Volume 2, Issue 2 (1991), pp. 195–220
Abstract
The observation problem along with the certain independent value plays a great role while carrying out control of dynamic systems in the conditions of uncertainty (Kalman, 1957, Krasovski, 1985, Leondes, 1976). A new approach on connection between the problems of control and observation is presented in (Gabasov, 1991). Developing it, we justify the solution of observation problem in the given paper that arises, at optimization of linear dynamic systems. The paper consists of the two parts. In the part I the linear discrete system is investigated. In the part II the linear dynamic continuous system is considered.