24 search results - page 2 / 5 » What makes some POMDP problems easy to approximate |
AIPS
2008
13 years 7 months ago
2008
Recently, considerable focus has been given to the problem of determining the boundary between tractable and intractable planning problems. To this end, we present complexity resu...
AMAI
2004
Springer
13 years 10 months ago
2004
Springer
This paper extends the framework of partially observable Markov decision processes (POMDPs) to multi-agent settings by incorporating the notion of agent models into the state spac...
EDM
2009
13 years 2 months ago
2009
In this paper, we present a study of a large corpus of student logic exercises in which we explore the relationship between two distinct measures of difficulty: the proportion of s...
ALT
2011
Springer
12 years 4 months ago
2011
Springer
Deep architectures are families of functions corresponding to deep circuits. Deep Learning algorithms are based on parametrizing such circuits and tuning their parameters so as to ...
FOCS
2009
IEEE
13 years 11 months ago
2009
IEEE
— We study the complexity of rationalizing network formation. In this problem we fix an underlying model describing how selfish parties (the vertices) produce a graph by making...