منابع مشابه
Management of Block-structured Programs
DRAFT for Software Practice and Experience submitted: March 1981. returned: March 1984. revised: June 1984. Experience with a technique for compiling subsets of the procedural elements of AlgolW programs is described. The method does not require modifications to the compiler, but does presume the existence of a random access file system. Complete management of the user’s source and object files...
متن کاملA Parameterized Strongly Polynomial Algorithm for Block Structured Integer Programs
The theory of n-fold integer programming has been recently emerging as an important tool in parameterized complexity. The input to an n-fold integer program (IP) consists of parameter A, dimension n, and numerical data of binary encoding length L. It was known for some time that such programs can be solved in polynomial time using O(ng(A)L) arithmetic operations where g is an exponential functi...
متن کاملA first-order block-decomposition method for solving two-easy-block structured semidefinite programs
In this paper, we consider a first-order block-decomposition method for minimizing the sum of a convex differentiable function with Lipschitz continuous gradient, and two other proper closed convex (possibly, nonsmooth) functions with easily computable resolvents. The method presented contains two important ingredients from a computational point of view, namely: an adaptive choice of stepsize f...
متن کاملA rst-order block-decomposition method for solving two-easy-block structured semide nite programs
In this paper, we consider a rst-order block-decomposition method for minimizing the sum of a convex di erentiable function with Lipschitz continuous gradient, and two other proper closed convex (possibly, nonsmooth) functions with easily computable resolvents. The method presented contains two important ingredients from a computational point of view, namely: an adaptive choice of stepsize for ...
متن کاملEvaluating Storage Management Schemes for Block Structured Languages
The conventional stomge allocation scheme for block srruclured languages requires the allocation of stack space and the building of a display with each procedure call. Several techniques have been proposed for analyzing the call graph of a program that make it possible to eliminate these operations from many call sequences. In this paper, we compare these techniques. and propose an improved all...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Software: Practice and Experience
سال: 1985
ISSN: 0038-0644,1097-024X
DOI: 10.1002/spe.4380150709