Sciweavers

450 search results - page 6 / 90
» Algorithmic uses of the Feferman-Vaught Theorem
Sort
View
CORR
2008
Springer
129views Education» more  CORR 2008»
14 years 9 months ago
A polytime proof of correctness of the Rabin-Miller algorithm from Fermat's little theorem
Although a deterministic polytime algorithm for primality testing is now known ([4]), the Rabin-Miller randomized test of primality continues being the most efficient and widely u...
Grzegorz Herman, Michael Soltys
83
Voted
BIRTHDAY
2007
Springer
15 years 1 months ago
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms
Abstract. The Operational Transformation (OT) approach is a technique for supporting optimistic replication in collaborative and mobile systems. It allows the users to concurrently...
Abdessamad Imine, Michaël Rusinowitch
90
Voted
EC
2006
163views ECommerce» more  EC 2006»
14 years 9 months ago
An Extension of Geiringer's Theorem for a Wide Class of Evolutionary Search Algorithms
The frequency with which various elements of the search space of a given evolutionary algorithm are sampled is affected by the family of recombination (reproduction) operators. Th...
Boris Mitavskiy, Jonathan E. Rowe

Book
250views
16 years 7 months ago
Algorithmic Information Theory
"The aim of this book is to present the strongest possible version of G¨odel's incompleteness theorem, using an information-theoretic approach based on the size of com...
G J Chaitin
GI
2001
Springer
15 years 2 months ago
Formal Analysis of a Self-Stabilizing Algorithm Using Predicate Diagrams
We present the verification of a protocol designed to ensure self-stabilization in a ring of processors. The proof is organized as a series of refinements; it is mechanized base...
Dominique Cansell, Dominique Méry, Stephan ...