Sciweavers

512 search results - page 45 / 103
» Automata as Abstractions
Sort
View
KI
2007
Springer
14 years 2 months ago
Training on the Job - Collecting Experience with Hierarchical Hybrid Automata
We propose a novel approach to experience collection for autonomous service robots performing complex activities. This approach enables robots to data for many learning problems at...
Alexandra Kirsch, Michael Beetz
LFCS
2007
Springer
14 years 2 months ago
Weighted O-Minimal Hybrid Systems Are More Decidable Than Weighted Timed Automata!
Abstract. We consider weighted o-minimal hybrid systems, which extend classical o-minimal hybrid systems with cost functions. These cost functions are “observer variables” whic...
Patricia Bouyer, Thomas Brihaye, Fabrice Chevalier
ISVLSI
2006
IEEE
95views VLSI» more  ISVLSI 2006»
14 years 2 months ago
PLAs in Quantum-dot Cellular Automata
Abstract— Research in the fields of physics, chemistry and electronics has demonstrated that Quantum-dot Cellular Automata (QCA) is a viable alternative for nano-scale computing...
Xiaobo Sharon Hu, Michael Crocker, Michael T. Niem...
ACRI
2004
Springer
14 years 2 months ago
Evolving Transition Rules for Multi Dimensional Cellular Automata
Abstract. Genetic Algorithms have been used before to evolve transition rules for one dimensional Cellular Automata (CA) to solve e.g. the majority problem and investigate communic...
Ron Breukelaar, Thomas Bäck
FORMATS
2004
Springer
14 years 2 months ago
Learning of Event-Recording Automata
Abstract. We extend Angluin’s algorithm for on-line learning of regular languages to the setting of timed systems. We consider systems that can be described by a class of determi...
Olga Grinchtein, Bengt Jonsson, Martin Leucker