580 search results - page 57 / 116 » Approximation Algorithms for Temporal Reasoning |
130
click to vote
NIPS
2007
15 years 4 months ago
2007
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
112
click to vote
ATAL
2004
Springer
15 years 8 months ago
2004
Springer
Decentralized MDPs provide a powerful formal framework for planning in multi-agent systems, but the complexity of the model limits its usefulness. We study in this paper a class o...
124
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We formulate the problem of least squares temporal difference learning (LSTD) in the framework of least squares SVM (LS-SVM). To cope with the large amount (and possible ...
150
click to vote
ECRTS
2004
IEEE
15 years 6 months ago
2004
IEEE
Dynamic storage allocation (DSA) algorithms play an important role in the modern software engineering paradigms and techniques (such as object oriented programming). Using DSA inc...
127
click to vote
ICCBR
2001
Springer
15 years 7 months ago
2001
Springer
Abstract. This paper proposes a fuzzy-rough method of maintaining CaseBased Reasoning (CBR) systems. The methodology is mainly based on the idea that a large case library can be tr...