224 search results - page 9 / 45 » Bounding Learning Time in XCS |
ICML
2008
IEEE
14 years 9 months ago
2008
IEEE
What type of algorithms and statistical techniques support learning from very large datasets over long stretches of time? We address this question through a memory bounded version...
LATA
2010
Springer
14 years 1 months ago
2010
Springer
Abstract. Kanazawa ([1]) has studied the learnability of several parameterized families of classes of categorial grammars. These classes were shown to be learnable from text, in th...
TIT
2002
13 years 8 months ago
2002
Generalization bounds depending on the margin of a classifier are a relatively recent development. They provide an explanation of the performance of state-of-the-art learning syste...
DAC
2006
ACM
14 years 2 days ago
2006
ACM
Statistical static timing analysis (SSTA) has been a popular research topic in recent years. A fundamental issue with applying SSTA in practice today is the lack of reliable and e...
ICANNGA
2007
Springer
14 years 2 months ago
2007
Springer
Reinforcement Learning (RL) is analyzed here as a tool for control system optimization. State and action spaces are assumed to be continuous. Time is assumed to be discrete, yet th...