— In this paper, three new methods for pushing solutions toward a desired region of the objective space more quickly are explored; hypercube distance scaling, dynamic objective t...
This article describes applications of modern heuristic search methods to pattern sequencing problems, i.e., problems seeking for a permutation of the rows of a given matrix with r...
A subspace based blind method is proposed for estimating the channel responses of a multi-user and multi-antenna OFDM uplink system. It gives estimations to all channel responses,...
We propose a new variational method to restore point-like and curvelike singularities in 2-D images. As points and open curves are fine structures, they are difficult to restore...
Many stochastic planning problems can be represented using Markov Decision Processes (MDPs). A difficulty with using these MDP representations is that the common algorithms for so...