In order to cope efficiently with simple or complex queries as well as different application requirements (e.g., ad-hoc versus repetitive queries), a query optimizer ought to supp...
This paper presents a detailed empirical study of local search for Boolean satisfiability (SAT), highlighting several interesting properties, some of which were previously unknown...
The paper presents a new genetic local search algorithm for multi-objective combinatorial optimization. The goal of the algorithm is to generate in a short time a set of approxima...
A method for the linear discrimination of two classes has been proposed by us in 3 . It searches for the discriminant direction which maximizes the distance between the projected c...
Randomized search heuristics (e.g., evolutionary algorithms, simulated annealing etc.) are very appealing to practitioners, they are easy to implement and usually provide good per...