945 search results - page 102 / 189 » Evolving Symbolic Controllers |
134
click to vote
ATAL
2009
Springer
15 years 10 months ago
2009
Springer
This paper presents a model of neural network embodiment of intentions and planning mechanisms for autonomous agents. The model bridges the dichotomy of symbolic and non-symbolic ...
131
click to vote
ATVA
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. This paper argues that flatness appears as a central notion in the verification of counter automata. A counter automaton is called flat when its control graph can be ...
135
click to vote
ICFEM
2004
Springer
15 years 9 months ago
2004
Springer
d Abstract) Carsten Sinz and Wolfgang K¨uchlin Symbolic Computation Group, WSI for Computer Science, University of T¨ubingen and Steinbeis Technology Transfer Center OIT, 72076 T...
141
click to vote
CAV
2006
Springer
15 years 7 months ago
2006
Springer
This paper addresses the problem of computing symbolically the set of reachable configurations of a linear hybrid automaton. A solution proposed in earlier work consists in explori...
164
click to vote
TIT
2010
14 years 10 months ago
2010
When there exists only a single multicast session in a directed acyclic/cyclic network, the existence of a network coding solution is characterized by the classic min-cut/max-flow ...