Sciweavers

2157 search results - page 50 / 432
» Binary ant algorithm
Sort
View
ACMSE
2010
ACM
13 years 6 months ago
Generating three binary addition algorithms using reinforcement programming
Reinforcement Programming (RP) is a new technique for automatically generating a computer program using reinforcement learning methods. This paper describes how RP learned to gene...
Spencer K. White, Tony R. Martinez, George L. Rudo...
ANTS
2004
Springer
121views Algorithms» more  ANTS 2004»
14 years 1 months ago
Function Field Sieve in Characteristic Three
In this paper we investigate the efficiency of the function field sieve to compute discrete logarithms in the finite fields F3n . Motivated by attacks on identity based encrypti...
Robert Granger, Andrew J. Holt, Dan Page, Nigel P....
ANTS
1994
Springer
83views Algorithms» more  ANTS 1994»
14 years 18 days ago
On orders of optimal normal basis generators
In this paper we give some computational results on the multiplicative orders of optimal normal basis generators in F2n over F2 for n 1200 whenever the complete factorization of 2...
Shuhong Gao, Scott A. Vanstone
ANTS
1994
Springer
92views Algorithms» more  ANTS 1994»
14 years 18 days ago
The complexity of greatest common divisor computations
We study the complexity of expressing the greatest common divisor of n positive numbers as a linear combination of the numbers. We prove the NP-completeness of finding an optimal s...
Bohdan S. Majewski, George Havas
ANTS
2010
Springer
291views Algorithms» more  ANTS 2010»
14 years 12 days ago
Fixed Points for Discrete Logarithms
: We establish a conjecture of Brizolis that for every prime p > 3 there is a primitive root r and an integer t in the interval [1, p − 1] with logr t = t. Here, logr is the d...
Mariana Levin, Carl Pomerance, K. Soundararajan