We consider a planning problem that generalizes Alcuin's river crossing problem (also known as: The wolf, goat, and cabbage puzzle) to scenarios with arbitrary conflict graph...
We will give a survey on results related to scheduling problems where machines are not continuously available for processing. We will deal with single and multi machine problems an...
Abstract. I present an overview of complexity results for model checking of temporal and strategic logics. Unfortunately, it is possible to manipulate the context so that different...
In many practical problems, we must combine ("fuse") data represented in different formats, e.g., statistical, fuzzy, etc. The simpler the data, the easier to combine th...
Mourad Oussalah, Hung T. Nguyen, Vladik Kreinovich
In this paper we present techniques to significantly improve the space complexity of several ordered tree comparison algorithms without sacrificing the corresponding time complexit...