-This paper presents a new class discriminability measure based on an adaptive partitioning of the feature space according to the available class samples. It is intended to be used as a criterion in a classifier-independent feature selection procedure. The partitioning is performed according to a binary splitting rule and appropriate stopping criteria. Results from several tests with Gaussian a...

We consider the problem of learning an unknown Markov Decision Process (MDP) that is weakly communicating in the infinite horizon setting. We propose a Thompson Sampling-based reinforcement learning algorithm with dynamic episodes (TSDE). At the beginning of each episode, the algorithm generates a sample from the posterior distribution over the unknown model parameters. It then follows the opti...

In this paper we propose a new image smoothing and edge detection technique that employs a combination of nonlinear diffusion and bilateral filtering. The model is based upon two very well established methodologies in the image processing community, which makes the method easy to understand and implement. Our numerical experiments show that the proposed model is capable of achieving more accura...

A major difficulty in the use of metaheuristics (i.e. evolutionary and particle swarm algorithms) to deal with multi-objective optimization problems is the choice of a convenient point at which to stop computation. Indeed, it is difficult to find the best compromise between the stopping criterion and the algorithm performance. This paper addresses this issue using the Non-dominated Sorting Gene...

This paper presents two simple and effective criteria for stopping the iteration process in turbo decoding with a negligible degradation of the error performance. Both criteria are devised based on the cross-entropy (CE) concept. They are as efficient as the CE criterion, but require much less and simpler computations.

As a typical NP-hard problem, open vehicle routing problem with soft time windows (OVRPSTW) is a kind of basic open vehicle routing problem with time windows. By setting fit neighbourhood structure, evaluation solutions, tabu list, and stopping criterion, author constructed a tabu search (TS) to solve the OVRPSTW. TS shows its good computational performance by testing benchmark problems.

We propose a denoising algorithm for medical images based on a combination of the total variation minimization scheme and the wavelet scheme. We show that our scheme offers effective noise removal in real noisy medical images while maintaining sharpness of objects. More importantly, this scheme allows us to implement an effective automatic stopping time criterion.

This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce subproblems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solve...

This paper proposes an adaptation of the RINS MIP heuristic which explicitly explores pre-processing techniques. The method systematically searches for the ideal number of fixations to produce subproblems of controlled size. These problems are explored in a Variable Neighborhood Descent fashion until a stopping criterion is met. Preliminary experiments implemented upon the open source MIP solve...

We study the optimal stopping problem of McKean-Vlasov diffusions when criterion is a function law stopped process. A remarkable new feature in this setting that time also impacts dynamics process through dependence coefficients on law. The mean field introduced weak formulation terms joint marginal underlying and survival This specification satisfies dynamic programming principle. correspondin...