๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Algorithms with memory for computation of properties

โœ Scribed by A. I. Kondrat'ev


Publisher
Springer US
Year
1988
Tongue
English
Weight
706 KB
Volume
24
Category
Article
ISSN
1573-8337

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Memory-efficient algorithms for the veri
โœ C. Courcoubetis; M. Vardi; P. Wolper; M. Yannakakis ๐Ÿ“‚ Article ๐Ÿ“… 1992 ๐Ÿ› Springer ๐ŸŒ English โš– 804 KB

This article addresses the problem of designing memory-efficient algorithms for the verification of temporal properties of finite-state programs. Both the programs and their desired temporal properties are modeled as automata on infinite words (Biichi automata). Verification is then reduced to check

Algorithms for the computation of spatia
โœ Martin Fisher ๐Ÿ“‚ Article ๐Ÿ“… 1990 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 648 KB

Algorithms are described for the calculation of spatial statistics. The statistics are the functions K(t), G(y), F(x), and K12(t). They can be used to determine (a) which type of spatial process ('random', ' clustered', 'regular', etc.) best fits a data set and whether the spatial pattern changes wi

Parallel implementation of a ray tracing
โœ Lee, Tong-Yee; Raghavendra, C. S.; Nicholas, John B. ๐Ÿ“‚ Article ๐Ÿ“… 1997 ๐Ÿ› John Wiley and Sons ๐ŸŒ English โš– 145 KB ๐Ÿ‘ 3 views

Ray tracing is a well known technique to generate life-like images. Unfortunately, ray tracing complex scenes can require large amounts of CPU time and memory storage. Distributed memory parallel computers with large memory capacities and high processing speeds are ideal candidates to perform ray tr