Sciweavers

3250 search results - page 208 / 650
» Parameterized Learning Complexity
Sort
View
KDD
2010
ACM
274views Data Mining» more  KDD 2010»
15 years 10 months ago
Grafting-light: fast, incremental feature selection and structure learning of Markov random fields
Feature selection is an important task in order to achieve better generalizability in high dimensional learning, and structure learning of Markov random fields (MRFs) can automat...
Jun Zhu, Ni Lao, Eric P. Xing
ESANN
2008
15 years 8 months ago
Learning Inverse Dynamics: a Comparison
While it is well-known that model can enhance the control performance in terms of precision or energy efficiency, the practical application has often been limited by the complexiti...
Duy Nguyen-Tuong, Jan Peters, Matthias Seeger, Ber...
AAMAS
2005
Springer
15 years 6 months ago
Cooperative Multi-Agent Learning: The State of the Art
Cooperative multi-agent systems are ones in which several agents attempt, through their interaction, to jointly solve tasks or to maximize utility. Due to the interactions among t...
Liviu Panait, Sean Luke

Source Code
1763views
17 years 3 months ago
dlib C++ Library
A library for developing portable applications that deal with networking, threads (message passing, futures, etc...), graphical interfaces, complex data structures, linear algebra,...
Davis E. King
IJCNN
2006
IEEE
16 years 17 days ago
Spatiotemporal Pattern Recognition via Liquid State Machines
— The applicability of complex networks of spiking neurons as a general purpose machine learning technique remains open. Building on previous work using macroscopic exploration o...
Eric Goodman, Dan Ventura