Abstract. For solving combinatorial optimisation problems, exact methods accurately exploit the structure of the problem but are tractable only up to a certain size; approximation ...
We study the dynamical behavior of the discontinuous Galerkin finite element method for initial value problems in ordinary differential equations. We make two different assumptions...
-- Most optimization algorithms that use probabilistic models focus on extracting the information from good solutions found in the population. A selection method discards the below...
: The development of complex access control architectures raises the problem of their management. In this article, we describe an architecture providing packet filters configuratio...
We address the problem of similarity search in large time series databases. We introduce a novel indexing algorithm that allows faster retrieval. The index is formed by creating b...