Sciweavers

1805 search results - page 85 / 361
» A Theory of Closure Operators
Sort
View
CEC
2007
IEEE
15 years 10 months ago
A simple genetic algorithm for music generation by means of algorithmic information theory
— Recent large scale experiments have shown that the Normalized Information Distance, an algorithmic information measure, is among the best similarity metrics for melody classi...
Manuel Alfonseca, Manuel Cebrián, Alfonso O...
LICS
2007
IEEE
15 years 10 months ago
A Contraction Method to Decide MSO Theories of Deterministic Trees
In this paper we generalize the contraction method, originally proposed by Elgot and Rabin and later extended by Carton and Thomas, from labeled linear orderings to colored determ...
Angelo Montanari, Gabriele Puppis
ISSAC
2007
Springer
142views Mathematics» more  ISSAC 2007»
15 years 10 months ago
Fast arithmetic for triangular sets: from theory to practice
We study arithmetic operations for triangular families of polynomials, concentrating on multiplication in dimension zero. By a suitable extension of fast univariate Euclidean divi...
Xin Li, Marc Moreno Maza, Éric Schost
CPM
2001
Springer
108views Combinatorics» more  CPM 2001»
15 years 9 months ago
A Very Elementary Presentation of the Hannenhalli-Pevzner Theory
In 1995, Hannenhalli and Pevzner gave a first polynomial solution to the problem of finding the minimum number of reversals needed to sort a signed permutation.Their solution, a...
Anne Bergeron
LOPSTR
2001
Springer
15 years 8 months ago
Proof Theory, Transformations, and Logic Programming for Debugging Security Protocols
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...
Giorgio Delzanno, Sandro Etalle