10271 search results - page 1885 / 2055 » Computer Science |
167
click to vote
JAPLL
2008
15 years 6 months ago
2008
In this paper, we study the following basic problem: After having executed a sequence of actions, find a sequence of actions that brings the agent back to the state just before th...
335
click to vote
DIMACS
1996
15 years 7 months ago
1996
in Structure'95. 14] R. Fagin. Easier ways to win logical games. In Proc. DIMACS Workshop on Descriptive Complexity and Finite Models, AMS 1997. 15] R. Fagin, L. Stockmeyer, M...
162
click to vote
STOC
2007
ACM
16 years 6 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
178
click to vote
ICS
2010
Tsinghua U.
16 years 3 months ago
2010
Tsinghua U.
We consider the problem of boosting the accuracy of weak learning algorithms in the agnostic learning framework of Haussler (1992) and Kearns et al. (1992). Known algorithms for t...
177
click to vote
JANCL
2008
15 years 6 months ago
2008
This paper employs epistemic logic to investigate the philosophical foundations of Bayesian updating in belief revision. By Bayesian updating, we understand the tenet that an agen...