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

Performance evaluation of vector implementations of combinatorial algorithms

โœ Scribed by Celso Ribeiro


Book ID
104304478
Publisher
Elsevier Science
Year
1984
Tongue
English
Weight
441 KB
Volume
1
Category
Article
ISSN
0167-8191

No coin nor oath required. For personal study only.

โœฆ Synopsis


We study the performance and the use of vector computers for the solution of combinatorial optimization problems, particularly dynamic programming and shortest path problems. A general model for performance evaluation and vector implementations for the problems described above are studied. These implementations were done on a CRAY-1 vector computer and the computational re:s. ults obtained show (i) the adequacy of the performance evaluation model and (ii) very important gains concerning computing times, showing that vector computers will be of great importance in the field of combinatorial optimization.


๐Ÿ“œ SIMILAR VOLUMES


Supervector performance without toil: FO
โœ Toshihiko Matsuura; Kenichi Miura; Mitsuhiro Makino ๐Ÿ“‚ Article ๐Ÿ“… 1985 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 615 KB

The advanced architecture and software of Fujitsu's new vector machines, the FACOM VP-100/200, allow one to extract maximum performance from a program by FORTRAN coding. Three examples of basic algorithms, i.e.. triangularization of a symmetric matrix, a radix-2 FFT, and a random number generator, a

Performance Evaluation of Document Struc
โœ Jisheng Liang; Ihsin T Phillips; Robert M Haralick ๐Ÿ“‚ Article ๐Ÿ“… 2001 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 114 KB

This paper presents a performance metric for the document structure extraction algorithms by finding the correspondences between detected entities and ground truth. We describe a method for determining an algorithm's optimal tuning parameters. We evaluate a group of document layout analysis algorith