: Ant Colony Optimization (ACO) is a class of metaheuristic algorithms sharing the common approach of constructing a solution on the basis of information provided both by a standar...
Abstract. In this paper we construct fixed finite tile systems that assemble into particular classes of shapes. Moreover, given an arbitrary n, we show how to calculate the tile co...
State of the art reasoners for expressive description logics, such as those that underpin the OWL ontology language, are typically based on highly optimized implementations of (hyp...
The existence of optimal algorithms is not known for any decision problem in NP \ P. We consider the problem of testing the membership in the image of an injective function. We co...
Edward A. Hirsch, Dmitry Itsykson, Valeria Nikolae...
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...