Scheduling algorithms for real-time systems can be characterized in various ways, one of the most important ones of which is the underlying task model. Many concepts of real-time ...
The foundations of a class of logic programming systems with the expressive power of full first-order logic and a non-monotonic component is addressed. The underlying refutation m...
Marco A. Casanova, Ramiro A. de T. Guerreiro, Andr...
It is well-known that modal satisfiability is PSPACE-complete [Lad77]. However, the complexity may decrease if we restrict the set of propositional operators used. Note that there ...
The problem of deriving weights from pairwise comparison matrices has been treated extensively in the literature. Most of the results are devoted to the case when the matrix under...
Nikolai V. Hovanov, James W. Kolari, Mikhail V. So...
— We consider the problem of supporting absolute QoS guarantees in terms of the end-to-end burst loss in OBS networks. We present a parameterized model for wavelength sharing whi...