744 search results - page 32 / 149 » Observations on the Decidability of Transitions |
ENTCS
2008
13 years 9 months ago
2008
Defining operational semantics for a process algebra is often based either on labeled transition systems that account for interaction with a context or on the so-called reduction ...
NIPS
1998
13 years 10 months ago
1998
In this paper, we address two issues of long-standing interest in the reinforcement learning literature. First, what kinds of performance guarantees can be made for Q-learning aft...
MVA
2007
13 years 8 months ago
2007
Abstract We propose a method for estimating the topology of distributed cameras, which can provide useful information for multi-target tracking in a wide area, without object ident...
AIPS
2006
13 years 10 months ago
2006
We study the consequences on complexity that arise when bounds on the number of branch points on the solutions for non-deterministic planning problems are imposed as well as when ...
MFCS
2001
Springer
14 years 1 months ago
2001
Springer
We describe a class of simple transitive semiautomata that exhibit full exponential blow-up during deterministic simulation. For arbitrary semiautomata we show that it is PSPACE-c...