| Record ID | marc_oregon_summit_records/catalog_files/washs02192008.mrc_revrev.mrc:1322990972:1148 |
| Source | Oregon Libraries |
| Download Link | /show-records/marc_oregon_summit_records/catalog_files/washs02192008.mrc_revrev.mrc:1322990972:1148?format=raw |
LEADER: 01148cam a2200337 a 4500
001 8024472
008 811220s1981 dcu b f000 0 eng d
035 $a(GPO)82003293
040 $aGPO$cGPO$dMvI
049 $aNTEI
074 $a407-H-1 (MF)
086 0 $aD 210.8/2:4430
100 1 $aShore, John E.
245 10 $aCross-entropy minimization given fully-decomposable subset and aggregate constraints /$cJohn E. Shore.
260 0 $aWashington, D.C. :$bNaval Research Laboratory,$c[1981]
300 $aiii, 22 p. ;$c28 cm.
440 0 $aNRL memorandum report ;$v4430.
500 $aCover title.
500 $a"Information Processing Systems Branch, Communications Sciences Division."
500 $a"February 13, 1981."
504 $aIncludes bibliographical references.
650 0 $aEntropy (Information theory)
650 0 $aQueuing theory.
650 0 $aComputer networks.
710 2 $aNaval Research Laboratory (U.S.).$bInformation Processing Systems Branch.
907 $a.b25823474$bwo $c-
902 $a040717
998 $b1$c980704$dm$ea$f-$g0
907 $a.b25823474
907 $a.b25823474
945 $lwoxau$aD 210.8/2:4430