Algorithm 251: function minimisation [E4]

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Algorithm 251: function minimisation [E4]

Full text

Pdf (421 KB)

Source

Communications of the ACM archive
Volume 8 , Issue 3 (March 1965) table of contents

Pages: 169 - 170

Year of Publication: 1965

ISSN:0001-0782

Author

M. Wells

Univ. of Leeds. Leeds, England, UK

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 2, Downloads (12 Months): 10, Citation Count: 0

Additional Information:

index terms peer to peer

Tools and Actions:	Review this Article Save this Article to a Binder Display Formats: BibTex EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/363791.363809 What is a DOI?

INDEX TERMS

Data structures for quadtree approximation and compression Communications of the ACM 28, 9
Hanan Samet
A hierarchical single-key-lock access control using the Chinese remainder theorem Proceedings of the 1992 ACM/SIGAPP Symposium on Applied computing
Kim S. Lee , Huizhu Lu , D. D. Fisher
The GemStone object database management system Communications of the ACM 34, 10
Paul Butterworth , Allen Otis , Jacob Stein
Putting innovation to work: adoption strategies for multimedia communication systems Communications of the ACM 34, 12
Ellen Francik , Susan Ehrlich Rudman , Donna Cooper , Stephen Levine
An intelligent component database for behavioral synthesis Proceedings of the 27th ACM/IEEE conference on Design automation
Gwo-Dong Chen , Daniel D. Gajski