We describe ongoing research to support the construction of terminologies with Description Logics. For the explanation of subsumption we search for particular concepts because of t...
We study the complexity of sequentially-optimal classical planning, and discover new problem classes for whose such optimization is tractable. The results are based on exploiting ...
The Bacterial Foraging Optimization (BFO) algorithm is a biologically inspired computation technique which is based on mimicking the foraging behavior of E.coli bacteria. This pape...
Jing Dang, Anthony Brabazon, Michael O'Neill, Davi...
In this paper we compare the average performance of one class of low-discrepancy quasi-Monte Carlo sequences for global optimization. Weiner measure is assumed as the probability ...
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...