SIGN IN
SIGN UP
Solving identification problem for asynchronous finite state machines using genetic algorithms
Full Text:
PDF
Buy this Article
Author:
Xiaojun Geng
California State University, Northridge, CA
Published in:
· Proceeding
GECCO '06
Proceedings of the 8th annual conference on Genetic and evolutionary computation
ACM
New York, NY
, USA
©2006
table of contents
ISBN:1-59593-186-4
doi>
10.1145/1143997.1144221
2006 Article
Bibliometrics
· Downloads (6 Weeks): 3
· Downloads (12 Months): 9
· Citation Count: 0
Tools and Resources
Buy this Article
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '12
Share:
|
Tags:
algorithms
asynchronous finite state machines
coding schemes
experimentation
genetic algorithms
model identification
modeling methodologies
performance
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