COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY...

Kybernetes 1987 / 03 Vol. 16; Iss. 3

COMPLETION TIMES IN NETWORKS—THE THEORY OF RELATIVELY CLOSED SYSTEMS APPLIED TO MAXIMUM OPERATORS

GRUBBSTRÖM, ROBERT W, LUNDQUIST, JANERIK
How much do you like this book?
What’s the quality of the file?
Download the book for quality assessment
What’s the quality of the downloaded files?
Volume:
16
Language:
english
Journal:
Kybernetes
DOI:
10.1108/eb005764
Date:
March, 1987
File:
PDF, 237 KB
english, 1987
Conversion to is in progress
Conversion to is failed