Sciweavers

315 search results - page 26 / 63
» Reactive Turing Machines
Sort
View
MPC
2004
Springer
116views Mathematics» more  MPC 2004»
14 years 1 months ago
An Injective Language for Reversible Computation
Abstract. Erasure of information incurs an increase in entropy and dissipates heat. Therefore, information-preserving computation is essential for constructing computers that use e...
Shin-Cheng Mu, Zhenjiang Hu, Masato Takeichi
CORR
2007
Springer
52views Education» more  CORR 2007»
13 years 8 months ago
Hierarchical Unambiguity
Abstract. We develop techniques to investigate relativized hierarchical unambiguous computation. We apply our techniques to push forward some known constructs involving relativized...
Holger Spakowski, Rahul Tripathi
EAAI
2006
75views more  EAAI 2006»
13 years 8 months ago
Multi-agent framework based on smart sensors/actuators for machine tools control and monitoring
Throughout the history, the evolutions of the requirements for manufacturing equipments have depended on the changes in the customers' demands. Among the present trends in th...
Xavier Desforges, Bernard Archimède
RAS
2010
109views more  RAS 2010»
13 years 7 months ago
Combining active learning and reactive control for robot grasping
Grasping an object is a task that inherently needs to be treated in a hybrid fashion. The system must decide both where and how to grasp the object. While selecting where to grasp...
Oliver Krömer, Renaud Detry, Justus H. Piater...
ATVA
2007
Springer
136views Hardware» more  ATVA 2007»
14 years 2 months ago
Symbolic Fault Tree Analysis for Reactive Systems
Fault tree analysis is a traditional and well-established technique for analyzing system design and robustness. Its purpose is to identify sets of basic events, called cut sets, wh...
Marco Bozzano, Alessandro Cimatti, Francesco Tappa...