Journal ArticleDOI
Algorithm 97: Shortest path
Reads0
Chats0
TLDR
The procedure was originally programmed in FORTRAN for the Control Data 160 desk-size computer and was limited to te t ra t ion because subroutine recursiveness in CONTROL Data 160 FORTRan has been held down to four levels in the interests of economy.Abstract:
procedure ari thmetic (a, b, c, op); in t eger a, b, c, op; ¢ o n l m e n t This procedure will perform different order ar i thmetic operations with b and c, put t ing the result in a. The order of the operation is given by op. For op = 1 addit ion is performed. For op = 2 multiplicaLion, repeated addition, is done. Beyond these the operations are non-commutat ive. For op = 3 exponentiat ion, repeated multiplication, is done, raising b to the power c. Beyond these the question of grouping is important . The innermost implied parentheses are at the right. The hyper-exponent is always c. For op = 4 te t ra t ion, repeated exponentiat ion, is done. For op = 5, 6, 7, etc., the procedure performs pentat ion, hexation, heptat ion, etc., respectively. The routine was originally programmed in FORTRAN for the Control Data 160 desk-size computer. The original program was limited to te t ra t ion because subroutine recursiveness in Control Data 160 FORTRAN has been held down to four levels in the interests of economy. The input parameter , b, c, and op, must be positive integers, not zero; b e g i n own i n t e g e r d, e, f, drop; i f o p = 1 t h e n b e g i n a := h-4c; go t o l e n d i f o p = 2 t h e n d := 0; else d := 1; e := c; drop := op 1; for f := I s t e p 1 u n t i l e do b e g i n ari thmetic (a, b, d, drop);read more
Citations
More filters
Journal ArticleDOI
Integrating new memories into the hippocampal network activity space
Giuseppe P. Gava,Giuseppe P. Gava,Stephen B. McHugh,Laura Lefèvre,Vítor Lopes-dos-Santos,Stéphanie Trouche,Mohamady El-Gaby,Simon R. Schultz,Simon R. Schultz,David Dupret +9 more
TL;DR: This article investigated the topology of neuronal co-activity and found that mnemonic information spans multiple operational axes in the mouse hippocampus network and revealed an organizational principle for continuous integration and interaction of hippocampal memories.
Proceedings ArticleDOI
Performance through memory
TL;DR: This work experimentally evaluates the intrinsic memory and processor requirements of various applications and indicates that several important applications are “memory-bound,” i.e., can benefit more from increased memory than from a faster processor.
Proceedings ArticleDOI
The CLRS Algorithmic Reasoning Benchmark
Petar Velivckovi'c,Adrià Puigdomènech Badia,David Budden,R.P. Pascanu,Andrea Banino,Mikhail Dashevskiy,Raia Hadsell,Charles Blundell +7 more
TL;DR: This work proposes the CLRS Algorithmic Reasoning Benchmark, covering classical algorithms from the Introduction to Algorithms textbook, and performs extensive experiments to demonstrate how several popular algorithmic reasoning baselines perform on these tasks, and consequently, highlight links to several open challenges.
Journal ArticleDOI
Automatic library migration for the generation of hardware-in-the-loop models
TL;DR: A generative programming approach that handles the diversity of test libraries is presented and a novel model analyzer facilitates the efficient application in practice by migrating existing libraries.
Avoiding Communication in Dense Linear Algebra
TL;DR: This thesis develops both new communication lower bounds and new algorithms, tightening (and in many cases closing) the gap between best known lower bound and best known algorithm (or upper bound).