Sciweavers

3136 search results - page 238 / 628
» Comparison of Clique-Listing Algorithms
Sort
View
HPCC
2010
Springer
15 years 6 months ago
A Generic Algorithm Template for Divide-and-Conquer in Multicore Systems
The divide-and-conquer pattern of parallelism is a powerful approach to organize parallelism on problems that are expressed naturally in a recursive way. In fact, recent tools such...
Carlos H. Gonzalez, Basilio B. Fraguela
IJIIDS
2007
57views more  IJIIDS 2007»
15 years 6 months ago
Evaluating learning algorithms and classifiers
: We analyse 18 evaluation methods for learning algorithms and classifiers, and show how to categorise these methods with the help of an evaluation method taxonomy based on several...
Niklas Lavesson, Paul Davidsson
CORR
2006
Springer
160views Education» more  CORR 2006»
15 years 6 months ago
On Conditional Branches in Optimal Search Trees
A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
Michael B. Baer
GECCO
2000
Springer
112views Optimization» more  GECCO 2000»
15 years 10 months ago
Code Compaction Using Genetic Algorithms
One method for compacting executable computer code is to replace commonly repeated sequences of instructions with macro instructions from a decoding dictionary. The size of the de...
Keith E. Mathias, Larry J. Eshelman, J. David Scha...
ASPDAC
1995
ACM
85views Hardware» more  ASPDAC 1995»
15 years 10 months ago
High-level synthesis scheduling and allocation using genetic algorithms
In this article a scheduling method is presented which is capable of allocating supplementary resources during scheduling. This makes it very suitable in synthesis strategies base...
Marc J. M. Heijligers, L. J. M. Cluitmans, Jochen ...