|
000
| 01695nam 2200313zi 4500 |
|---|
| 001 | 9.879417 |
|---|
| 003 | CaOODSP |
|---|
| 005 | 20221107165516 |
|---|
| 006 | m o d f |
|---|
| 007 | cr |n||||||||| |
|---|
| 008 | 190918e198408##onc|||| ob f000 0|eng d |
|---|
| 040 | |aCaOODSP|beng|erda|cCaOODSP |
|---|
| 043 | |an-cn--- |
|---|
| 086 | 1 |aCo24-210/1984E-PDF |
|---|
| 100 | 1 |aVidyasagar, M. |q(Mathukumalli), |d1947- |eauthor. |
|---|
| 245 | 14|aThe dynamic file allocation problem in a three-computer network with a linear topology / |cby Professor M. Vidyasagar. |
|---|
| 246 | 04|aThe dynamic file allocation problem in a three-computer network with a linear topology : |bfinal report |
|---|
| 264 | 1|a[Ottawa] : |bDepartment of Communications, |cAugust 1984. |
|---|
| 300 | |a1 online resource (73 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]. |
|---|
| 504 | |aIncludes bibliographical references (page 72-73). |
|---|
| 520 | 3 |a"This report is devoted to the dynamic file allocation problem in a three-computer network, which is not completely connected. Under several assumptions the problem is formulated as a discrete time optimal control problem and an explicit solution is derived using backward dynamic programming. Several numerical results from computer simulations are also presented"--Abstract. |
|---|
| 692 | 07|2gccst|aComputer programming |
|---|
| 710 | 1 |aCanada. |bDepartment of Communications. |
|---|
| 856 | 40|qPDF|s3.14 MB|uhttps://publications.gc.ca/collections/collection_2019/isde-ised/Co24/Co24-210-1984-eng.pdf |
|---|