To solve real-world discrete optimization problems approximately metaheuristics such as simulated annealing and other local search methods are commonly used. For large instances o...
— We consider the approximate string membership checking (ASMC) problem of extracting all the strings or substrings in a document that approximately match some string in a given ...
We propose the use of a new algorithm to solve multiobjective optimization problems. Our proposal adapts the well-known scatter search template for single objective optimization to...
Antonio J. Nebro, Francisco Luna, Enrique Alba, Be...
Abstract— This paper addresses a problem of finding an optimal dynamic quantizer for nonlinear control subject to discretevalued signal constraints. The quantizers to be studied...
We consider the compilation of different reasoning tasks into the evaluation problem of quantified boolean formulas (QBFs) as an approach to develop prototype reasoning systems us...
Uwe Egly, Thomas Eiter, Hans Tompits, Stefan Woltr...