We consider the problem of checking whether a finite (or ultimately periodic) run satisfies a temporal logic formula. This problem is at the heart of “runtime verification” ...
Despite the growth of Internet and the advances in WWW technology, current methods for web users to make good use of information from so enormous web pages are not as efficient as ...
This paper presents our experiences with building of the soft state XSiena publish/subscribe system. We provide a brief overview of our approach towards the soft state in publish/...
The aim of this discussion paper is to stimulate (or perhaps to provoke) stronger interactions among theoreticians and practitioners interested in efficient problem solutions. We ...
We consider the problem of scheduling on parallel uniformly related machines, where preemptions are allowed and the machines are controlled by selfish agents. Our goal is to minimi...