665 search results - page 107 / 133 » The Theory of Hybrid Automata |
AMAST
2006
Springer
13 years 11 months ago
2006
Springer
We propose two characterizations of complexity classes by means of programming languages. The first concerns Logspace while the second leads to Ptime. This latter characterization ...
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
Synchronous data-flow languages such as Scade/Lustre manage infinite sequences, or streams, as primitive values making them naturally adapted to the description of datadominated s...
ZUM
2000
Springer
13 years 11 months ago
2000
Springer
: Retrenchment is introduced as a liberalisation of refinement intended to address some of the shortcomings of refinement as sole means of progressing from simple abstract models t...
PODC
1991
ACM
13 years 11 months ago
1991
ACM
Abstract. Self-stabilizing message driven protocols are deļ¬ned and discussed. The class weakexclusion that contains many natural tasks such as -exclusion and token-passing is deļ...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
This paper presents the dynamics of multi-agent reinforcement learning in multiple state problems. We extend previous work that formally modelled the relation between reinforcemen...