Results 211 to 220 of about 10,100 (267)

Program units and procedures

2004
Abstract A description of how a complete program is built from a main program and, optionally, subroutines and functions, some or all of which may be packaged into modules. They may themselves contain internal subroutines and functions.
Michael Metcalf, John Reid, Malcolm Cohen   +2 more
openaire   +1 more source

Procedures and Program Structure

1978
In the corresponding chapter of part 1 (chapter 1.4) we saw that in Algol 60 blocks and procedures are nested one inside another, storage allocation is dynamic, and store availability and sharing are organised by the common access of all blocks and procedures to the stack, subject to the scope rules for identifiers.
openaire   +1 more source

A Solution Procedure for Geometric Programming

Operations Research, 1976
The theory of geometric programming is concerned with the solution of certain nonlinear programming problems in which the objective function and the constraints are polynomial expressions with positive coefficients. The solution of the primal geometric programming problem can be obtained by solving the dual problem.
openaire   +2 more sources

A convex programming procedure

Naval Research Logistics Quarterly, 1959
AbstractThe procedure which involves successively minimizing a convex function with respect to each of its coordinates is shown to converge if constraints are rectangular and the function has continuous derivatives. It is also shown that certain more general procedures, which might be expected to converge more rapidly, are convergent.
openaire   +1 more source

A Convergent Procedure for Convex Programming

Journal of the Society for Industrial and Applied Mathematics, 1963
Gegeben ist eine beliebige Menge \(X\) und ein Vektor \(v(x) = (v_0(x), v_1(x),\dots, v_m(x))\), dessen Komponenten auf \(X\) definierte reellwertige Funktionen sind. Ferner werden definiert: \(u\cdot v\) als Skalarprodukt der Vektoren \(u = (u_0, u_1,\dots, u_m)\) and \(v = (v_0, v_1,\dots, v_m)\), der Wertebereich von \(v(x)\) als \(V = \{v(x)\mid x ...
openaire   +1 more source

Transformation of Procedural Programs

1990
In the previous chapters, it has been mentioned several times that the major part of any program development by transformations can be done at the level of applicative formulations. Nevertheless, when aiming at the efficient running of programs on conventional von Neumann machines, a few more transformations have to be available for introducing ...
openaire   +1 more source

Non-procedural logic programming

1994
We present a logic programming language where both problem domain and computational knowledge are expressed in logic. A logic program in this language consists of an object-program and a number of meta-programs. The object program, a collection of formulae, is a description of the problem domain of interest.
openaire   +1 more source

A Simplified Procedure for Quadratic Programming

Operations Research, 1963
The problem discussed in this paper deals with maximization (minimization) under linear restrictions, of a quadratic function of the form (1/2XtUX + VX) where U is negative (positive) semi definite. The optimum solution to this problem can be obtained by solving a certain enlarged system of equations representing the Kuhn-Tucker conditions.
openaire   +2 more sources

Procedure based program compression

Proceedings of 30th Annual International Symposium on Microarchitecture, 1999
Darko Kirovski, Johnson Kin, William H. Mangione-Smith   +2 more
openaire   +1 more source

Primitive program schemata with procedures

Automatic Control and Computer Sciences, 2014
Algebraic models of program are widely used for the analysis of program behavior. In this paper we study the equivalence problem for algebraic models of programs with procedures and equivalent transformations of program schemata. Among the algebraic models of programs with procedures we selected a subclass of gateway models and the corresponding ...
openaire   +1 more source