SIGN IN
SIGN UP
Extending XCSF beyond linear approximation
Full Text:
PDF
Buy this Article
Authors:
Pier Luca Lanzi
Artificial Intelligence and Robotics Laboratory (AIRLab), Milano, Italy and University of Illinois at Urbana Champaign, Urbana, IL
Daniele Loiacono
Artificial Intelligence and Robotics Laboratory (AIRLab), Milano, Italy
Stewart W. Wilson
University of Illinois at Urbana Champaign, Urbana, IL and Prediction Dynamics, Concord, MA
David E. Goldberg
University of Illinois at Urbana Champaign, Urbana, IL
2005 Article
Bibliometrics
· Downloads (6 Weeks): 2
· Downloads (12 Months): 11
· Downloads (cumulative): 218
· Citation Count: 22
Published in:
· Proceeding
GECCO '05 Proceedings of the 2005 conference on Genetic and evolutionary computation
Pages 1827-1834
ACM
New York, NY
, USA
©2005
table of contents
ISBN:1-59593-010-8
doi>
10.1145/1068009.1068319
Tools and Resources
Buy this Article
Request Permissions
TOC Service:
Email
RSS
Save to Binder
Export Formats:
BibTeX
EndNote
ACM Ref
Upcoming Conference:
GECCO '13
Share:
|
Tags:
algorithms
function approximation
lcs
least squares
least squares approximation
linear approximation
models of computation
performance
xcs
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