9842 search results - page 351 / 1969 » Problem complexity |
162
click to vote
NIPS
1992
15 years 8 months ago
1992
This paper describes the adaption and application of an algorithm called Feudal Reinforcement Learning to a complex gridworld navigation problem. The algorithm proved to be not ea...
179
click to vote
CLIMA
2008
15 years 8 months ago
2008
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
224
click to vote
LICS
2012
IEEE
13 years 9 months ago
2012
IEEE
—We show that if a finite relational structure has a near unanimity polymorphism, then the constraint satisfaction problem with that structure as its fixed template has bounded...
193
click to vote
ALGORITHMICA
2008
15 years 7 months ago
2008
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...
192
click to vote
NECO
2002
15 years 6 months ago
2002
Many perception, reasoning, and learning problems can be expressed as Bayesian inference. We point out that formulating a problem as Bayesian inference implies specifying a probabi...