2157 search results - page 85 / 432 » Binary ant algorithm |
CSE
2008
IEEE
15 years 16 days ago
2008
IEEE
We study the problem of counting and randomly sampling binary contingency tables. For given row and column sums, we are interested in approximately counting (or sampling) 0/1 n
96
Voted
ICANNGA
2009
Springer
15 years 7 months ago
2009
Springer
A statistical generative model is presented as an alternative to negative selection in anomaly detection of string data. We extend the probabilistic approach to binary classificat...
IPL
2000
15 years 7 days ago
2000
A polynomial time algorithm is developed for computing an upper bound for the rotation distance of binary trees and equivalently for the diagonal-flip distance of convex polygons ...
75
Voted
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
We discuss testing methods for exposing origin-seeking bias in PSO motion algorithms. The strategy of resizing the initialization space, proposed by Gehlhaar and Fogel and made po...
118
click to vote
MPC
1992
Springer
15 years 4 months ago
1992
Springer
In this paper we derive a linear-time, constant-space algorithm to construct a binary heap whose inorder traversal equals a given sequence. We do so in two steps. First, we invert...