102 search results - page 13 / 21 » Verifying space and time requirements for resource-bounded a... |
121
click to vote
DAGSTUHL
2007
15 years 1 months ago
2007
Abstract. In this paper, we consider the problem of filtering in relational hidden Markov models. We present a compact representation for such models and an associated logical par...
APPROX
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. In this paper, we propose a general framework for designing fully polynomial time approximation schemes for combinatorial optimization problems, in which more than one ob...
SPIN
2000
Springer
15 years 3 months ago
2000
Springer
Abstract. We report on the use of model checking techniques for both the verification of a process control program and the derivation of optimal control schedules. Most of this wor...
128
Voted
CI
2005
15 years 6 days ago
2005
Autonomous agents that learn about their environment can be divided into two broad classes. One class of existing learners, reinforcement learners, typically employ weak learning ...
ECOOP
2005
Springer
15 years 5 months ago
2005
Springer
There are many algorithms for concurrent garbage collection, but they are complex to describe, verify, and implement. This has resulted in a poor understanding of the relationships...