3250 search results - page 55 / 650 » Parameterized Learning Complexity |
COLT
2006
Springer
14 years 1 months ago
2006
Springer
Bounds are given for the empirical and expected Rademacher complexity of classes of linear transformations from a Hilbert space H to a ...nite dimensional space. The results imply ...
IWPEC
2009
Springer
14 years 4 months ago
2009
Springer
We study the Equitable Connected Partition problem, which is the problem of partitioning a graph into a given number of partitions, such that each partition induces a connected sub...
ICMLA
2009
13 years 7 months ago
2009
We describe a system that successfully transfers value function knowledge across multiple subdomains of realtime strategy games in the context of multiagent reinforcement learning....
ICRA
2006
IEEE
14 years 4 months ago
2006
IEEE
— This paper demonstrates a learning mechanism for complex tasks. Such tasks may be inherently expensive to learn in terms of training time and/or cost of obtaining each training...
ICPR
2008
IEEE
14 years 11 months ago
2008
IEEE
Complex simulations can generate very large amounts of data stored disjointly across many local disks. Learning from this data can be problematic due to the difficulty of obtainin...