default search action
Machine Learning, Volume 23, 1996
Volume 23, Number 1, April 1996
- Paolo Frasconi, Marco Gori, Marco Maggini, Giovanni Soda:
Representation of Finite State Automata in Recurrent Radial Basis Function Networks. 5-32 - Foster J. Provost, John M. Aronis:
Scaling Up Inductive Learning with Massive Parallelism. 33-46 - H. Altay Güvenir, Izzet Sirin:
Classification by Feature Partitioning. 47-67 - Gerhard Widmer, Miroslav Kubat:
Learning in the Presence of Concept Drift and Hidden Contexts. 69-101 - Michael J. Pazzani:
Review of "Inductive Logic Programming: Techniques and Applications" by Nada Lavrac, Saso Dzeroski. 103-108 - Nada Lavrac, Saso Dzeroski:
A Reply to Pazzani's Book Review of "Inductive Logic Programming: Techniques and Applications". 109-111
Volume 23, Numbers 2-3, May 1996
- Scott W. Bennett, Gerald DeJong:
Real-World Robotics: Learning to Plan for Robust Execution. 121-161 - Holger Friedrich, Stefan Münch, Rüdiger Dillmann, Siegfried Bocionek, Michael Sassin:
Robot Programming by Demonstration (RPD): Supporting the Induction by Human Interaction. 163-189 - Peter C. Y. Chen, James K. Mills, Kenneth C. Smith:
Performance Improvement of Robot Continuous-Path Operation through Iterative Learning Using Neural Networks. 191-220 - Cristina Baroglio, Attilio Giordana, Roberto Piola, Michael Kaiser, Marnix Nuttin:
Learning Controllers for Industrial Robots. 221-249 - Marcos Salganicoff, Lyle H. Ungar, Ruzena Bajcsy:
Active Learning for Vision-Based Robot Grasping. 251-278 - Minoru Asada, Shoichi Noda, Sukoya Tawaratsumida, Koh Hosoda:
Purposive Behavior Acquisition for a Real Robot by Vision-Based Reinforcement Learning. 279-303 - Volker Klingspor, Katharina Morik, Anke D. Rieger:
Learning Concepts from Sensor Data of a Mobile Robot. 305-332
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.