2767 search results - page 256 / 554 » Universal Exponentiation Algorithm |
123
click to vote
ISNN
2005
Springer
15 years 8 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...
129
click to vote
SAT
2005
Springer
15 years 8 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...
GECCO
2004
Springer
15 years 8 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...
124
click to vote
ISAAC
2004
Springer
15 years 8 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 ...
112
click to vote
SAT
2004
Springer
15 years 8 months ago
2004
Springer
Abstract. This paper discusses an NP-complete constraint satisfaction problem which appears to share many of the threshold characteristics of SAT but is similar to XOR-SAT and so i...