Undecidability results in rewriting have usually been proved by reduction from undecidable problems of Turing machines or, more recently, from Post’s Correspondence Problem. Ano...
We discuss scheduling problems with m identical machines and n jobs where each job has to be assigned to some machine. The goal is to optimize objective functions that solely depe...
Noga Alon, Yossi Azar, Gerhard J. Woeginger, Tal Y...
The objective of this contribution is to analyze statistical properties of estimated models of cascade systems. Models of such systems are important in for example cascade control ...
State explosion is a fundamental problem in the analysis and synthesis of discrete event systems. Continuous Petri nets can be seen as a relaxation of discrete models allowing more...
This paper describes one of the ways how to overcome one of the major limitations of current fulltext search engines. It deals with synonymy of the web search engine results by clu...