View Item 

Show simple item record

An adaptive random search algorithm with linear complexity in dimension

dc.contributor.authorZabinsky, Zelda Barbaraen_US
dc.contributor.authorSmith, Robert L.en_US
dc.date.accessioned2006-02-03T16:42:40Z
dc.date.available2006-02-03T16:42:40Z
dc.date.issued1990en_US
dc.identifierUMR4534en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/8480
dc.format.extent30 bytes
dc.format.extent44655 bytes
dc.format.extent3366 bytes
dc.format.extent50844 bytes
dc.format.extent2141593 bytes
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypetext/plain
dc.format.mimetypeapplication/pdf
dc.language.isoen_USen_US
dc.subjectMonte Carlo method.en_US
dc.subjectMathematical optimization.en_US
dc.subjectAlgorithms.en_US
dc.titleAn adaptive random search algorithm with linear complexity in dimensionen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/8480/5/bam0416.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/8480/4/bam0416.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

Name:
bam0416.0001.001.txt
Size:
49.65KB
Format:
Text file
View/Open
Name:
bam0416.0001.001.pdf
Size:
2.042MB
Format:
PDF
View/Open

Show simple item record

Remediation of Harmful Language

The University of Michigan Library aims to describe library materials in a way that respects the people and communities who create, use, and are represented in our collections. Report harmful or offensive language in catalog records, finding aids, or elsewhere in our collections anonymously through our metadata feedback form. More information at Remediation of Harmful Language.

Accessibility

If you are unable to use this file in its current format, please select the Contact Us link and we can modify it to make it more accessible to you.