2157 search results - page 99 / 432 » Binary ant algorithm |
73
Voted
MOC
2000
15 years 8 days ago
2000
The best algorithm known for finding logarithms on an elliptic curve (E) is the (parallelized) Pollard lambda collision search. We show how to apply a Pollard lambda search on a se...
84
Voted
JDA
2010
14 years 11 months ago
2010
Cars have to be painted in two colors in a sequence where each car occurs twice; assign the two colors to the two occurrences of each car so as to minimize the number of color chan...
100
click to vote
ICSE
2004
IEEE-ACM
16 years 17 days ago
2004
IEEE-ACM
Dynamic slicing algorithms can greatly reduce the debugging effort by focusing the attention of the user on a relevant subset of program statements. Recently algorithms for forwar...
EVOW
2004
Springer
15 years 5 months ago
2004
Springer
This paper describes a novel representation and ordering model that, aided by an evolutionary algorithm, is used in solving the graph k-colouring problem. Its strength lies in redu...
94
Voted
SODA
2001
ACM
15 years 1 months ago
2001
ACM
We introduce a new updatable representation ofbinary trees. The structure requires the information theoretic minimum 2n + o(n) bits and supports basic navigational operations in c...