Abstract. Up to now, research on speed-up techniques for DIJKSTRA’s algorithm focused on single-criteria scenarios. The goal was to find the quickest route within a transportati...
— We consider the problem of determining the existence of known constant signals over a set of sites, given noisy measurements obtained by a team of active sensors that can switc...
Jerome Le Ny, Michael M. Zavlanos, George J. Pappa...
The paper describes a general glance to the use of element exchange techniques for optimization over permutations. A multi-level description of problems is proposed which is a fund...
Applying parameter adaptation means operating on parameters of an algorithm while it is tackling an instance. For ant colony optimization, several parameter adaptation methods have...
Motivated by optimization problems in sensor coverage, we formulate and study the Minimum-Area Spanning Tree (mast) problem: Given a set P of n points in the plane, find a spannin...