Baeten, Bergstra, and Klop (and later Caucal) have proved the remarkable result that bisimulation equivalence is decidable for irredundant context-free grammars. In this paper we ...
We introduce the ALeRT (Action-dependent Learning Rates with Trends) algorithm that makes two modifications to the learning rate and one change to the exploration rate of traditio...
Maria Cutumisu, Duane Szafron, Michael H. Bowling,...
A generic architecture for autonomous agents is presented. In commonwith other current proposals the agent is capable of reacting to and reasoning about events which occur in its ...
Subrata Kumar Das, John Fox, D. Elsdon, Peter Hamm...
We develop a behavioural theory of distributed programs in the presence of failures such as nodes crashing and links breaking. The framework we use is that of D, a language in whi...
d Abstract) Adrian Francalanza and Matthew Hennessy University of Sussex, Falmer Brighton BN1 9RH, England Abstract. We develop a behavioural theory of distributed programs in the ...