SIGN IN
SIGN UP
Scalability of an MPI-based fast messy genetic algorithm
Full Text:
Pdf
Buy this Article
Authors:
Laurence D, Merkle
Center for Plasma Theory and Computation, Air Force Research Laboratory, Kirtland AFB, OH
George H. Gates, Jr.
Air Force Research Laboratory, WL HPC Technical Focal Point, Wright-Patterson AFB, OH
Gary B. Lamont
Department of Electrical and Computer Engineering, Graduate School of Engineering, Air Force Institute of Technology, Wright-Patterson AFB, OH
Published in:
· Proceeding
SAC '98 Proceedings of the 1998 ACM symposium on Applied Computing
ACM
New York, NY
, USA
©1998
table of contents
ISBN:0-89791-969-6
doi>
10.1145/330560.330845
1998 Article
Bibliometrics
· Downloads (6 Weeks): 0
· Downloads (12 Months): 7
· Citation Count: 0
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
SAC 2012
Share:
|
Tags:
algorithms
biology and genetics
experimentation
fixed solution quality
heuristic methods
human factors
measurement
messy genetic algorithms
parallel genetic algorithms
parallelism and concurrency
polypeptide structure prediction
population sizing
Feedback
|
Switch to
single page view
(no tabs)
**Javascript is not enabled and is required for the "tabbed view" or switch to the
single page view
**
Powered by
The ACM Guide to Computing Literature
All Tags
Export Formats
Save to Binder