Distributed applications are often built from sets of distributed components that must be co-ordinated in order to achieve some global behaviour. The common approach is to use a c...
The generalization of policies in reinforcement learning is a main issue, both from the theoretical model point of view and for their applicability. However, generalizing from a se...
With a left-continuous t-norm , we may associate the set of its vertical cuts, namely, the set F of functions fa : [0, 1] → [0, 1], x → x a. Endowed with the pointwise order, ...
Heuristic search for the global minimum is studied. This paper is focused on the adaptation of control parameters in differential evolution (DE) and in controlled random search (...
In this paper, we discuss kernels that can be applied for the classification of XML documents based on their DOM trees. DOM trees are ordered trees in which every node might be la...
Peter Geibel, Olga Pustylnikov, Alexander Mehler, ...