𝔖 Bobbio Scriptorium
✦   LIBER   ✦

On the Power of the Linear Array Architecture for Performing Tree-Structured Computations

✍ Scribed by K. Kalpakis; Y. Yesha

Publisher
Elsevier Science
Year
1995
Tongue
English
Weight
985 KB
Volume
50
Category
Article
ISSN
0022-0000

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Linear time algorithms for computing the
Linear time algorithms for computing the most reliable source on an unreliable tree network
✍ Xue, Guoliang πŸ“‚ Article πŸ“… 1997 πŸ› John Wiley and Sons 🌐 English βš– 121 KB πŸ‘ 2 views

Given a tree network with n vertices where each edge has an operational probability, we are interested in finding a vertex on the tree whose expected number of reachable vertices is maximum. This problem was studied in Networks 27 (1996) 219-237, where an O(n 3 ) time algorithm and an O(n 2 ) time a

A Simple New Structural Force Field for
A Simple New Structural Force Field for the Computation of Linear Metallocenes
✍ Peter Comba; Thomas Gyr πŸ“‚ Article πŸ“… 1999 πŸ› John Wiley and Sons 🌐 English βš– 236 KB πŸ‘ 2 views

A new structural force field for metallocenes is presented, searched with a cartesian stochastic search routine and energy barriers have been computed by scanning the which involves harmonic bonding potentials from the metal center to each of the carbon atoms, no angular potentials pseudo-torsional

The effect of restructing compilers on p
The effect of restructing compilers on program performance for high-speed computers
✍ Ron Cytron; David J. Kuck; Alex V. Veidenbaum πŸ“‚ Article πŸ“… 1985 πŸ› Elsevier Science 🌐 English βš– 747 KB

This paper describes a compiler for transforming serial programs into parallel form, and studies the importance of several transformations. An array machine is selected as the target architecture. A Set of programs is compiled and their execution time is measured by simulation. The transformations a

A novel approach for reducing the comput
A novel approach for reducing the computational cost of GA in synthesizing low sidelobe unequally spaced linear arrays
✍ Shuai Zhang; Shu-Xi Gong; Ying Guan; Bao Lu πŸ“‚ Article πŸ“… 2011 πŸ› John Wiley and Sons 🌐 English βš– 220 KB πŸ‘ 1 views

This article presents two approaches to reduce the computational cost of genetic algorithm (GA) in generating low sidelobe linear arrays by optimizing the element positions subject to the multiple design constraints of the number of elements, the array aperture dimension, and the minimum interelemen