Sciweavers

3510 search results - page 221 / 702
» Searching with numbers
Sort
View
CEC
2010
IEEE
15 years 4 months ago
A hybrid multi-objective extremal optimisation approach for multi-objective combinatorial optimisation problems
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...
Pedro Gómez-Meneses, Marcus Randall, Andrew...
ICPR
2008
IEEE
16 years 1 months ago
An online polygonal approximation of digital signals and curves with Dynamic Programming algorithm
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 ...
Alexander Kolesnikov
SAC
2006
ACM
16 years 19 days ago
Investigating the use of summarisation for interactive XML retrieval
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...
Zoltán Szlávik, Anastasios Tombros, ...
FPL
2003
Springer
80views Hardware» more  FPL 2003»
15 years 12 months ago
High-Level Design Tools for FPGA-Based Combinatorial Accelerators
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,...
ECML
2006
Springer
15 years 10 months ago
Why Is Rule Learning Optimistic and How to Correct It
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...