Given an undirected graph with n nodes, the Maximum Leaf Spanning Tree problem is to find a spanning tree with as many leaves as possible. When parameterized in the number of leav...
Henning Fernau, Joachim Kneis, Dieter Kratsch, Ale...
A weighted sequence is a string in which a set of characters may appear at each position with respective probabilities of occurrence. A common task is to locate a given motif in a ...
Selection methods in Evolutionary Algorithms, including Genetic Algorithms, Evolution Strategies ES and Evolutionary Programming, EP are compared by observing the rate of converge...
Abstract In this paper we focus on property-preserving preorders between timed game automata and their application to control of partially observable systems. We define timed weak ...
Peter Bulychev, Thomas Chatain, Alexandre David, K...
This paper contains two important contributions for the development of possibilistic causal networks. The first one concerns the representation of interventions in possibilistic ...