988 search results - page 61 / 198 » Pseudo-Genetic Algorithmic Composition |
FFA
2010
14 years 7 months ago
2010
Let p be prime and Zpn a degree n unramified extension of the ring of p-adic integers Zp. In this paper we give an overview of some very fast deterministic algorithms for common o...
FMSD
2008
14 years 10 months ago
2008
Abstract Compositional reasoning aims to improve scalability of verification tools by reducing the original verification task into subproblems. The simplification is typically base...
SACRYPT
2001
Springer
15 years 2 months ago
2001
Springer
—For cryptographic applications, normal bases have received considerable attention, especially for hardware implementation. In this article, we consider fast software algorithms ...
ICWS
2010
IEEE
14 years 11 months ago
2010
IEEE
Data intensive applications, e.g. in life sciences, pose new efficiency challenges to the service composition problem. Since today computing power is mainly increased by multiplica...
CORR
2008
Springer
14 years 10 months ago
2008
Springer
Efficient algorithms are known for many operations on truncated power series (multiplication, powering, exponential, . . . ). Composition is a more complex task. We isolate a larg...