2157 search results - page 89 / 432 » Binary ant algorithm |
92
Voted
ANTS
2004
Springer
15 years 5 months ago
2004
Springer
We present a technique to recover f ∈ Q(ζp) where ζp is a primitive pth root of unity for a prime p, given its norm g = f ∗ ¯f in the totally real field Q(ζp + ζ−1 p )....
SWAT
2004
Springer
15 years 5 months ago
2004
Springer
For n disjoint line segments in the plane we can construct a binary encompassing tree such that every vertex is pointed, what’s more, at every segment endpoint all incident edges...
117
click to vote
GECCO
2003
Springer
15 years 5 months ago
2003
Springer
Negative selection algorithm is one of the most widely used techniques in the field of artificial immune systems. It is primarily used to detect changes in data/behavior patterns...
95
Voted
DCC
2007
IEEE
15 years 19 days ago
2007
IEEE
This paper describes design of a low-complexity algorithm for adaptive encoding/decoding of binary sequences produced by memoryless sources. The algorithm implements universal blo...
117
Voted
CCCG
1998
15 years 1 months ago
1998
In this paper, we study weak {proximity drawings. All known algorithms that compute (weak) proximity drawings produce representations whose area increases exponentiallywith the nu...