Results 1  10
of
102
ACCURACY OF IBM’S SUBROUTINE GAUSS”
, 1971
"... Subroutine GAUSS is an IBM routine which computes a normally distributed random number with given mean and standard deviation. This routine is based upon an application of the central limit theorem and the use of the random number generator. In this note we will give a short explanation of how this ..."
Abstract
 Add to MetaCart
Subroutine GAUSS is an IBM routine which computes a normally distributed random number with given mean and standard deviation. This routine is based upon an application of the central limit theorem and the use of the random number generator. In this note we will give a short explanation of how
The Application of FORTRAN to Automatic Translation
"... This paper wants to show that one of the most widespread problemoriented languages, originally created for mathematicians, may efficiently be used for nonnumerical dataprocessing, if the necessary subroutines are available ..."
Abstract
 Add to MetaCart
This paper wants to show that one of the most widespread problemoriented languages, originally created for mathematicians, may efficiently be used for nonnumerical dataprocessing, if the necessary subroutines are available
Development of a Mathematical Subroutine Library for Fujitsu Vector Parallel Processors
, 1998
"... ... Project is a joint research program involving staff at the Australian National University and Fujitsu Japan. The aim of the project is to produce a library of mathematical subroutines for the vectorparallel Fujitsu VPP300 which result in high performance and accuracy on large problems. In ord ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
... Project is a joint research program involving staff at the Australian National University and Fujitsu Japan. The aim of the project is to produce a library of mathematical subroutines for the vectorparallel Fujitsu VPP300 which result in high performance and accuracy on large problems
Resource Bound Certification
, 2000
"... Various code certification systems allow the certification and static verification of important safety properties such as memory and controlflow safety. These systems are valuable tools for verifying that untrusted and potentially malicious code is safe before execution. However, one important safe ..."
Abstract

Cited by 132 (9 self)
 Add to MetaCart
certification systems, both of which are necessary for a practical system: We allow the execution time of programs and their subroutines to vary, depending on their arguments, and we provide a fully automatic compiler generating certified executables from sourcelevel programs. The principal device in our
Computer Algebra Algorithms and Routines for the Computation of Conservation Laws and Fixing of Gauge in Differential Expressions
, 1999
"... Three different approaches for the determination of conservation laws of differential equations are presented. For three corresponding REDUCE computer algebra programs CONLAW1/2/3 the necessary subroutines are described. One of them simplifies general solutions of overdetermined PDE systems so that ..."
Abstract

Cited by 18 (6 self)
 Add to MetaCart
Three different approaches for the determination of conservation laws of differential equations are presented. For three corresponding REDUCE computer algebra programs CONLAW1/2/3 the necessary subroutines are described. One of them simplifies general solutions of overdetermined PDE systems so
Communication and Memory Optimized Tree Contraction and List Ranking
, 2000
"... We present a simple and efficient algorithm for the Tree Contraction Problem on a Coarse Grained pMultiprocessor. With respect to its total computing time, its demand of memory and its total interprocessor communication it is only a small constant factor away from optimality. Unless traditional PR ..."
Abstract
 Add to MetaCart
PRAM algorithms it doesn’t use List Ranking as a necessary subroutine but specializes to List Ranking when applied to lists.
Towards Automatic Discovery of Building Blocks in Genetic Programming
 Working Notes for the AAAI Symposium on Genetic Programming
, 1995
"... This paper presents an algorithm for the discovery of building blocks in genetic programming (GP) called adaptive representation through learning (ARL). The central idea of ARL is the adaptation of the problem representation, by extending the set of terminals and functions with a set of evolvable su ..."
Abstract

Cited by 16 (0 self)
 Add to MetaCart
subroutines. The set of subroutines extracts common knowledge emerging during the evolutionary process and acquires the necessary structure for solving the problem. ARL supports subroutine creation and deletion. Subroutine creation or discovery is performed automatically based on the differential parent
On the secondorder feasibility cone: primaldual representation and efficient projection
, 2006
"... Abstract. We study the secondorder feasibility cone F = {y ∈ R n: ‖My‖≤g T y} for given data (M,g). We construct a new representation for this cone and its dual based on the spectral decomposition of the matrix M T M − gg T. This representation is used to efficiently solve the problem of projecting ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
of projecting an arbitrary point x ∈ R n onto F: miny{‖y − x ‖ : ‖My‖≤g T y}, whichasidefrom theoretical interest also arises as a necessary subroutine in the rescaled perceptron algorithm. We develop a method for solving the projection problem to an accuracy ε, whose computational complexity is bounded by O
Towards Automatic Discovery of Building Blocks in Genetic Programming
"... This paper presents an algorithm for the discovery of building blocks in genetic programming (GP) called adaptive representation through learning (ARL). The central idea ARL is the adaptation of the problem representation, by extending the set of terminals and functions with a set of evolvable subro ..."
Abstract
 Add to MetaCart
subroutines. The set of subroutines extracts common knowledge emerging during the evolutionary process and acquires the necessary structure for solving the problem. ARL supports subroutine creation and deletion. Subroutine creation or discovery is performed automatically based on the differential parent
CallbyValue Problems
"... Each subroutine operates in in its own local environment plus surrounding environments defined by the language’s scope rules. When a subroutine is invoked, it is necessary to pass parameters from the caller to the callee. A basic question concerning parameter passing is: For each parameter, what exa ..."
Abstract

Cited by 7 (2 self)
 Add to MetaCart
Each subroutine operates in in its own local environment plus surrounding environments defined by the language’s scope rules. When a subroutine is invoked, it is necessary to pass parameters from the caller to the callee. A basic question concerning parameter passing is: For each parameter, what
Results 1  10
of
102