1449 search results - page 218 / 290 » Self-Randomized Exponentiation Algorithms |
144
click to vote
IEEEICCI
2006
IEEE
16 years 6 days ago
2006
IEEE
This paper investigates possible connection strategies in sparsely connected associative memory models. This is interesting because real neural networks must have both efficient p...
160
click to vote
ISNN
2005
Springer
15 years 11 months ago
2005
Springer
Built on the theories of biological neural network, artificial neural network methods have shown many significant advantages. However, the memory space in an artificial neural chip...
161
click to vote
SAT
2005
Springer
15 years 11 months ago
2005
Springer
Current algorithms for bounded model checking (BMC) use SAT methods for checking satisfiability of Boolean formulas. These BMC methods suffer from a potential memory explosion prob...
131
click to vote
GECCO
2004
Springer
15 years 11 months ago
2004
Springer
Abstract. This paper studies the inducement of sequentiality in genetic algorithms (GAs) for uniformly-scaled problems. Sequentiality is a phenomenon in which sub-solutions converg...
157
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...