|
000
| 01750cam 2200337zi 4500 |
|---|
| 001 | 9.879900 |
|---|
| 003 | CaOODSP |
|---|
| 005 | 20221107165636 |
|---|
| 006 | m o d f |
|---|
| 007 | cr |n||||||||| |
|---|
| 008 | 190930e197205##onc|||| ob f000 0|eng d |
|---|
| 040 | |aCaOODSP|beng|erda|cCaOODSP |
|---|
| 043 | |an-cn--- |
|---|
| 086 | 1 |aCo22-372/1972E-PDF |
|---|
| 100 | 1 |aDeMercado, John, |eauthor. |
|---|
| 245 | 14|aThe synthesis of computer-communications networks / |cby John deMercado & Kalman Toth. |
|---|
| 264 | 1|aOttawa : |bTerrestrial Planning Branch, Department of Communications, |cMay 1972. |
|---|
| 300 | |a1 online resource (180 pages) |
|---|
| 336 | |atext|btxt|2rdacontent |
|---|
| 337 | |acomputer|bc|2rdamedia |
|---|
| 338 | |aonline resource|bcr|2rdacarrier |
|---|
| 500 | |aDigitized edition from print [produced by Innovation, Science and Economic Development Canada]. |
|---|
| 500 | |a"This study was part of Kalman Toth's work for the Master of Engineering degree at Carleton University in 1972"--Forward. |
|---|
| 504 | |aIncludes bibliographical references (pages 179-180). |
|---|
| 520 | 3 |a"In this study, techniques in the form of computationally feasible Algorithms are presented for the optimal synthesis of minimum cost simultaneous transmission networks and the near optimal synthesis of minimum cost time shared computer communication networks. Methods and Algorithms are also given for the synthesis of minimum cost non flow redundant networks"--Abstract. |
|---|
| 692 | 07|2gccst|aSoftware |
|---|
| 692 | 07|2gccst|aTelecommunications |
|---|
| 700 | 1 |aToth, Kalman Csaba, |eauthor. |
|---|
| 710 | 1 |aCanada. |bDepartment of Communications. |
|---|
| 856 | 40|qPDF|s7.84 MB|uhttps://publications.gc.ca/collections/collection_2019/isde-ised/Co22/Co22-372-1972-eng.pdf |
|---|