Sciweavers

5790 search results - page 1003 / 1158
» Distributed programming with distributed authorization
Sort
View
ICML
2007
IEEE
14 years 10 months ago
Combining online and offline knowledge in UCT
The UCT algorithm learns a value function online using sample-based search. The TD() algorithm can learn a value function offline for the on-policy distribution. We consider three...
Sylvain Gelly, David Silver
ICML
2006
IEEE
14 years 10 months ago
Nightmare at test time: robust learning by feature deletion
When constructing a classifier from labeled data, it is important not to assign too much weight to any single input feature, in order to increase the robustness of the classifier....
Amir Globerson, Sam T. Roweis
ICML
1996
IEEE
14 years 10 months ago
On the Learnability of the Uncomputable
Within Valiant'smodel of learning as formalized by Kearns, we show that computable total predicates for two formallyuncomputable problems the classical Halting Problem, and t...
Richard H. Lathrop
SIGSOFT
2008
ACM
14 years 10 months ago
Automatically locating framework extension examples
Using and extending a framework is a challenging task whose difficulty is exacerbated by the poor documentation that generally comes with the framework. Even in the presence of do...
Barthélémy Dagenais, Harold Ossher
SIGSOFT
2007
ACM
14 years 10 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a develo...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev...
« Prev « First page 1003 / 1158 Last » Next »