Sciweavers

3342 search results - page 278 / 669
» Symbolic Robustness Analysis
Sort
View
ICCAD
1997
IEEE
117views Hardware» more  ICCAD 1997»
15 years 11 months ago
Generalized matching from theory to application
This paper presents a novel approach for post-mapping optimization. We exploit the concept of generalized matching, a technique that nds symbolically all possible matching assignm...
Patrick Vuillod, Luca Benini, Giovanni De Micheli
ZUM
2000
Springer
132views Formal Methods» more  ZUM 2000»
15 years 10 months ago
A Formal Architecture for the 3APL Agent Programming Language
Abstract. The notion of agents has provided a way of imbuing traditional computing systems with an extra degree of flexibility that allows them to be more resilient and robust in t...
Mark d'Inverno, Koen V. Hindriks, Michael Luck
IJCAI
1989
15 years 7 months ago
Building a World Model for a Mobile Robot Using Dynamic Semantic Constraints
We are developing a new paradigm for a world model construction system which interprets a scene and builds a world model for a mobile robot using dynamic semantic constraints. The...
Minoru Asada, Yoshiaki Shirai
JFR
2006
88views more  JFR 2006»
15 years 6 months ago
Discovering natural kinds of robot sensory experiences in unstructured environments
We derive categories directly from robot sensor data to address the symbol grounding problem. Unlike model-based approaches where human intuitive correspondences are sought betwee...
Daniel H. Grollman, Odest Chadwicke Jenkins, Frank...
MFCS
2010
Springer
15 years 5 months ago
Properties of Visibly Pushdown Transducers
Abstract. Visibly pushdown transducers (VPTs) form a strict subclass of pushdown transducers (PTs) that extends finite state transducers with a stack. Like visibly pushdown automa...
Emmanuel Filiot, Jean-François Raskin, Pier...