The longest path problem is to find a longest path in a given graph. While the graph classes in which the Hamiltonian path problem can be solved efficiently are widely investigat...
Class Hierarchies, Factories, and Stable Designs M uch of the debate about the general aptness of class hierarchies is rooted in the different objectives taxonomists and implemente...
We consider the estimation of the order, i.e., the number of hidden states, of a special class of discrete-time finite-alphabet hidden Markov sources. This class can be characteriz...
The maximum independent set problem is NP-complete for graphs in general, but becomes solvable in polynomial time when restricted to graphs in many special classes. The problem is ...
Fuzzy integrals are commonly used as aggregation operators. In this paper we present new composite models based on fuzzy integrals with several t-conorms. These models permit to f...