Sciweavers

3250 search results - page 17 / 650
» Parameterized Learning Complexity
Sort
View
FCT
2011
Springer
12 years 9 months ago
Parameterized Complexity of Vertex Deletion into Perfect Graph Classes
Pinar Heggernes, Pim van 't Hof, Bart M. P. Jansen...
ISAAC
2007
Springer
183views Algorithms» more  ISAAC 2007»
14 years 4 months ago
The Complexity of Finding Subgraphs Whose Matching Number Equals the Vertex Cover Number
The class of graphs where the size of a minimum vertex cover equals that of a maximum matching is known as K¨onig-Egerv´ary graphs. K¨onig-Egerv´ary graphs have been studied ex...
Sounaka Mishra, Venkatesh Raman, Saket Saurabh, So...
ICRA
2010
IEEE
145views Robotics» more  ICRA 2010»
13 years 8 months ago
Reinforcement learning of motor skills in high dimensions: A path integral approach
— Reinforcement learning (RL) is one of the most general approaches to learning control. Its applicability to complex motor systems, however, has been largely impossible so far d...
Evangelos Theodorou, Jonas Buchli, Stefan Schaal
IJCNN
2006
IEEE
14 years 3 months ago
Reinforcement Learning for Parameterized Motor Primitives
Abstract— One of the major challenges in both action generation for robotics and in the understanding of human motor control is to learn the “building blocks of movement genera...
Jan Peters, Stefan Schaal