2157 search results - page 199 / 432 » Binary ant algorithm |
172
click to vote
TC
2008
15 years 6 months ago
2008
In this contribution we introduce a low-complexity bit-parallel algorithm for computing square roots over binary extension fields. Our proposed method can be applied for any type ...
166
click to vote
AI
2011
Springer
15 years 1 months ago
2011
Springer
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding sele...
175
click to vote
JSAC
2010
15 years 1 months ago
2010
In this paper, we present a generalization of the ordered statistics decoding (OSD) techniques for the class of intersymbol interference (ISI) channels, and show decoding results f...
173
click to vote
KDD
2001
ACM
16 years 6 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
131
click to vote
WIA
2005
Springer
15 years 12 months ago
2005
Springer
There has been several attempts over the years to solve the bisimulation minimization problem for finite automata. One of the most famous algorithms is the one suggested by Paige ...