This paper examines the CORBA Naming, Event, Notification, Trading, Time and Security Services, with the objective of identifying the issues that must be addressed in order make ...
We prove that for every c > 0 there exists a constant K = K(c) such that every graph G with n vertices and minimum degree at least cn contains a cycle of length t for every even...
This paper presents a formal notation for specifying requirements of embedded systems which exhibit continuous, real-time behaviour and move through various modes under digital co...
Given a graph on n vertices which is the union of two comparability graphs on the same vertex set, it always contains a clique or independent set of size n 1 3 . On the other hand...
In this paper we implement a computational model of a neuromodulatory system in an autonomous robot. The output of the neuromodulatory system acts as a value signal, modulating wi...