Relaxed plans are used in the heuristic search planner FF for computing a numerical heuristic and extracting helpful actions. We present a novel way for extracting information fro...
Previous work suggests that reminding a conversational partner of mutually known information depends on the conversants' attentional state, their resource limits and the reso...
The rough surface inverse scattering problem is approached with a combination of evolutionary strategies and the simplex method. The surface, assumed one-dimensional and perfectly ...
A Genetic Algorithm, embedded in a simulation-based method, is applied to the identification of Asynchronous Finite State Machines. Two different coding schemes and their associat...
This paper introduces a novel analogy with the way in which honeybee colonies operate in order to solve the problem of sparse and quasi dense reconstruction. To successfully solve...