Extremal optimisation (EO) is a relatively recent nature-inspired heuristic whose search method is especially suitable to solve combinatorial optimisation problems. To date, most o...
A fast online algorithm was developed for polygonal approximation of signals and curves with a minimum number of line segments for a given constraint on the standard deviation of ...
As the number of components in XML documents is much larger than that of ‘flat’ documents, we believe it is essential to provide users of XML information retrieval systems wi...
Analysis of different combinatorial search algorithms has shown that they have a set of distinctive features in common. The paper suggests a number of reusable blocks that support ...
Valery Sklyarov, Iouliia Skliarova, Pedro Almeida,...
Abstract. In their search through a huge space of possible hypotheses, rule induction algorithms compare estimations of qualities of a large number of rules to find the one that ap...
Martin Mozina, Janez Demsar, Jure Zabkar, Ivan Bra...