1532 search results - page 128 / 307 » The Symbol Grounding Problem |
134
click to vote
CAV
2010
Springer
15 years 8 months ago
2010
Springer
Graded-CTL is an extension of CTL with graded quantifiers which allow to reason about either at least or all but any number of possible futures. In this paper we show an extension...
110
click to vote
CONCUR
2009
Springer
15 years 11 months ago
2009
Springer
We present a compositional method for deriving control constraints on a network of interconnected, partially observable and partially controllable plant components. The constraint ...
116
click to vote
ISSAC
2007
Springer
15 years 10 months ago
2007
Springer
A new randomized algorithm is presented for computing the characteristic polynomial of an n × n matrix over a field. Over a sufficiently large field the asymptotic expected com...
141
click to vote
ACSC
2005
IEEE
15 years 10 months ago
2005
IEEE
The global dynamics of automata networks (such as neural networks) are a function of their topology and the choice of automata used. Evolutionary methods can be applied to the opt...
116
click to vote
ICTAI
2005
IEEE
15 years 10 months ago
2005
IEEE
Stochastic Shortest Path problems (SSPs) can be efficiently dealt with by the Real-Time Dynamic Programming algorithm (RTDP). Yet, RTDP requires that a goal state is always reach...