Two infinite walks on the same finite graph are called compatible if it is possible to introduce delays into them in such a way that they never collide. Years ago, Peter Winkler a...
Dempsterās rule for combining two belief functions assumes the independence of the sources of information. If this assumption is questionable, I suggest to use the least speciļ¬...
Abstract. Although it is known from GA literature that proportionate selection is subject to many pitfalls, the LCS community somewhat adhered to proportionate selection. Also in t...
We introduce a framework based on Wirtinger calculus for nonlinear complex-valued signal processing such that all computations can be directly carried out in the complex domain. Th...
In this paper, we develop model checking procedures for three ways of combining (temporal) logics: temporalization, independent combination, and join. We prove that they are termin...
Massimo Franceschet, Angelo Montanari, Maarten de ...