SIGN IN
SIGN UP
Solving the subset interconnection design problem using genetic algorithms
Authors:
Farts N. AbuAli
Roger L. Wainwright
Dale A. Schoenefeld
Published in:
· Proceeding
SAC '96 Proceedings of the 1996 ACM symposium on Applied Computing
Pages 299-304
ACM
New York, NY
, USA
©1996
table of contents
ISBN:0-89791-820-7
doi>
10.1145/331119.331196
1996 Article
Bibliometrics
· Downloads (6 Weeks): n/a
· Downloads (12 Months): n/a
· Downloads (cumulative): n/a
· Citation Count: 0
Tools and Resources
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Share:
|
Tags:
algorithms
design
genetic algorithms
heuristic methods
interconnection architectures
interconnection design problem
measurement
minimum spanning tree
performance
theory
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