6715 search results - page 502 / 1343 » Learning from a Test Set |
174
click to vote
ECML
2003
Springer
16 years 7 days ago
2003
Springer
We present an algorithm for learning context free grammars from positive structural examples (unlabeled parse trees). The algorithm receives a parameter in the form of a finite se...
157
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
Learning goal-scoring behaviour from scratch for simulated robot soccer is considered to be a very difficult problem, and is often achieved by endowing players with an innate set ...
191
Voted
TSMC
2008
15 years 6 months ago
2008
Learning Automata (LA) were recently shown to be valuable tools for designing Multi-Agent Reinforcement Learning algorithms. One of the principal contributions of LA theory is tha...
197
click to vote
JIIS
2000
15 years 6 months ago
2000
Abstract. A paper document processing system is an information system component which transforms information on printed or handwritten documents into a computer-revisable form. In ...
192
click to vote
SAGT
2010
Springer
15 years 5 months ago
2010
Springer
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...