Coverart for item
The Resource Cross-entropy minimization given fully-decomposable subset and aggregate constraints, John E. Shore

Cross-entropy minimization given fully-decomposable subset and aggregate constraints, John E. Shore

Label
Cross-entropy minimization given fully-decomposable subset and aggregate constraints
Title
Cross-entropy minimization given fully-decomposable subset and aggregate constraints
Statement of responsibility
John E. Shore
Creator
Contributor
Subject
Language
eng
Cataloging source
GPO
Government publication
federal national government publication
Index
no index present
Literary form
non fiction
Nature of contents
bibliography
Series statement
NRL memorandum report
Series volume
4430
Label
Cross-entropy minimization given fully-decomposable subset and aggregate constraints, John E. Shore
Instantiates
Publication
Note
  • Cover title
  • "Information Processing Systems Branch, Communications Sciences Division."
  • "February 13, 1981."
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier MARC source
rdacarrier
Content category
text
Content type MARC source
rdacontent
Dimensions
28 cm.
Extent
iii, 22 p.
Media category
unmediated
Media MARC source
rdamedia
System control number
(OCoLC)ocn373673861
Label
Cross-entropy minimization given fully-decomposable subset and aggregate constraints, John E. Shore
Publication
Note
  • Cover title
  • "Information Processing Systems Branch, Communications Sciences Division."
  • "February 13, 1981."
Bibliography note
Includes bibliographical references
Carrier category
volume
Carrier MARC source
rdacarrier
Content category
text
Content type MARC source
rdacontent
Dimensions
28 cm.
Extent
iii, 22 p.
Media category
unmediated
Media MARC source
rdamedia
System control number
(OCoLC)ocn373673861

Library Locations

    • Harold B. Lee Library Brigham Young University, Provo, UT, 84602, US
      40.249156 -111.649242
Processing Feedback ...