This paper presents a highly efficient, fully parallelized implementation of the compact genetic algorithm (cGA) to solve very large scale problems with millions to billions of va...
Kumara Sastry, David E. Goldberg, Xavier Llor&agra...
The traveling salesman problem with time windows is known to be a really difficult benchmark for optimization algorithms. In this paper, we are interested in the minimization of th...
Abstract— This paper presents coverage algorithms for mobile sensor networks in which agents have limited power to move. Rather than making use of a constrained optimization tech...
We consider pixel labeling problems where the label set
forms a tree, and where the observations are also labels.
Such problems arise in feature-space analysis with a very
large...
Pedro Felzenszwalb, Gyula Pap, Eva Tardos, Ramin Z...
— This constribution considers nonlinear space-time equalisation (STE) designed for single-input multiple-output (SIMO) systems. By exploiting the inherent symmetry of the underl...