9842 search results - page 365 / 1969 » Problem complexity |
154
click to vote
MFCS
1989
Springer
15 years 11 months ago
1989
Springer
In this paper we review the key results about space bounded complexity classes, discuss the central open problems and outline the prominent proof techniques. We show that, for a s...
197
click to vote
DAGSTUHL
2006
15 years 8 months ago
2006
Abstract. The Galois connection involving polymorphisms and coclones has received a lot of attention in regard to constraint satisfaction problems. However, it fails if we are inte...
168
click to vote
JMLR
2010
15 years 1 months ago
2010
Given a matrix M of low-rank, we consider the problem of reconstructing it from noisy observations of a small, random subset of its entries. The problem arises in a variety of app...
215
click to vote
AGI
2011
14 years 10 months ago
2011
We present an actor-critic scheme for reinforcement learning in complex domains. The main contribution is to show that planning and I/O dynamics can be separated such that an intra...