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...
Abstract Population-based meta-heuristics are algorithms that can obtain very good results for complex continuous optimization problems in a reduced amount of time. These search al...
Amilkar Puris, Rafael Bello, Daniel Molina, Franci...
The 0 1 MultidimensionalKnapsack Problem (0 1 MKP) is a NP-complete problem. Its resolution for large scale instances requires a prohibitive processing time. In this paper we prop...
Genetic algorithms are heuristic search algorithm used in science, engineering and many other areas. They are powerful but slow because of their evolutionary nature that mimics th...
Email Retrieval task has recently taken much attention to help the user retrieve the email(s) related to the submitted query. Up to our knowledge, existing email retrieval ranking...