13 search results - page 3 / 3 » Bounds for the computational power and learning complexity o... |
COLT
1993
Springer
13 years 9 months ago
1993
Springer
The Vapnik-Chervonenkis (V-C) dimension is an important combinatorial tool in the analysis of learning problems in the PAC framework. For polynomial learnability, we seek upper bou...
WSC
2000
13 years 6 months ago
2000
STRACTION FOR DISCRETE EVENT SYSTEMS USING NEURAL NETWORKS AND SENSITIVITY INFORMATION Christos G. Panayiotou Christos G. Cassandras Department of Manufacturing Engineering Boston ...
ATAL
2010
Springer
13 years 6 months ago
2010
Springer
A major challenge for traditional approaches to multiagent learning is to train teams that easily scale to include additional agents. The problem is that such approaches typically...