This paper shows how a recently introduced class of applications can be solved by constraint programming. This new type of application is due to the emergence of special real-time...
In this paper we introduce a new compressed representation for the connectivity of a triangle mesh. We present local compression and decompression algorithms which are fast enough...
: This communication describes a representation of images as a set of edges characterized by their position and orientation. This representation allows the comparison of two images...
This paper presents a novel camera network design methodology based on the Parisian evolutionary computation approach. This methodology proposes to partition the original problem ...
Various algorithms can compute approximate feasible points or approximate solutions to equality and bound constrained optimization problems. In exhaustive search algorithms for gl...