20197 search results - page 3547 / 4040 » Comparing Computational Power |
131
click to vote
KDD
2010
ACM
15 years 9 months ago
2010
ACM
Concise representations of frequent itemsets sacrifice readability and direct interpretability by a data analyst of the concise patterns extracted. In this paper, we introduce an...
137
Voted
ESA
2007
Springer
15 years 9 months ago
2007
Springer
A token is hidden in one out of n boxes following some known probability distribution and then all the boxes are locked. The goal of a searcher is to find the token in at most D n...
138
click to vote
ESEM
2007
ACM
15 years 9 months ago
2007
ACM
In 2005, we studied the development effort and effect of quality comparisons between software development with Fagan's inspection and pair development. Three experiments were...
166
Voted
GECCO
2007
Springer
15 years 9 months ago
2007
Springer
This paper introduces a function that increases the amount of neutrality (inactive code in Genetic Programming) for the Artificial Ant Problem. The objective of this approach is t...
160
Voted
GLVLSI
2007
IEEE
15 years 9 months ago
2007
IEEE
This paper presents a pipelined architecture of a modular Montgomery multiplier, which is suitable to be used in public key coprocessors. Starting from a baseline implementation o...