This paper deals with a multi-stage two-person zero-sum game called the multi-stage search allocation game (MSSAG), in which a searcher and an evader participate. The searcher dist...
: We propose a new algorithm to the problem of polygonal curve approximation based on a multiresolution approach. This algorithm is suboptimal but still maintains some optimality b...
This paper describes a novel numerical model aiming at solving moving-boundary problems such as free-surface flows or fluid– structure interaction. This model uses a moving-gr...
Nicolas Bodard, Roland Bouffanais, Michel O. Devil...
This is an algorithm for finding neighbors for point objects that can freely move and have no predefined position. The query sphere consists of a center location and a given radiu...
In this paper we study the problem of bivariate density estimation. The aim is to find a density function with the smallest number of local extreme values which is adequate with ...