View Item 

Show simple item record

Comparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacity
dc.contributor.authorBethke, A. D. (Albert Donally)en_US
dc.date.accessioned2006-02-03T17:30:42Z
dc.date.available2006-02-03T17:30:42Z
dc.date.issued1976en_US
dc.identifierUMR0339en_US
dc.identifier.urihttps://hdl.handle.net/2027.42/3571
dc.format.extent40 bytes
dc.format.extent28560 bytes
dc.format.extent3366 bytes
dc.format.extent34507 bytes
dc.format.extent1887278 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.subjectCombinatorial optimization.en_US
dc.subjectAlgorithms.en_US
dc.subjectParallel processing (Electronic computers)en_US
dc.subjectTechnical report (University of Michigan. Logic of Computers Group)en_US
dc.titleComparison of genetic algorithms and gradient-based optimizers on parallel processors : efficiency of use of processing capacityen_US
dc.typeTechnical Reporten_US
dc.subject.hlbtoplevelEngineeringen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/3571/5/bab2674.0001.001.pdfen_US
dc.description.bitstreamurlhttp://deepblue.lib.umich.edu/bitstream/2027.42/3571/4/bab2674.0001.001.txten_US
dc.owningcollnameEngineering, College of - Technical Reports


Files in this item

Name:
bab2674.0001.001.txt
Size:
33.69KB
Format:
Text file
View/Open
Name:
bab2674.0001.001.pdf
Size:
1.799MB
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.