1974 search results - page 80 / 395 » On Unbiased Linear Approximations |
102
click to vote
ICRA
2009
IEEE
15 years 7 months ago
2009
IEEE
Abstract— Least-squares policy iteration is a useful reinforcement learning method in robotics due to its computational efficiency. However, it tends to be sensitive to outliers...
CORR
2010
Springer
15 years 22 days ago
2010
Springer
We study a general class of problems called F -Deletion problems. In an F -Deletion problem, we are asked whether a subset of at most k vertices can be deleted from a graph G such...
119
Voted
SODA
2001
ACM
15 years 2 months ago
2001
ACM
In the 0-extension problem, we are given a weighted graph with some nodes marked as terminals and a semimetric on the set of terminals. Our goal is to assign the rest of the nodes ...
87
Voted
MMAS
2010
Springer
14 years 7 months ago
2010
Springer
The accuracy of atomistic-to-continuum hybrid methods can be guaranteed only for deformations where the lattice configuration is stable for both the atomistic energy and the hybrid...
104
click to vote
SIAMCOMP
2000
15 years 13 days ago
2000
We consider the problem of designing a near-optimal linear decision tree to classify two given point sets B and W in n. A linear decision tree de nes a polyhedral subdivision of sp...