Sciweavers

2905 search results - page 42 / 581
» Formal Memetic Algorithms
Sort
View
ISMB
1996
13 years 10 months ago
A Grammar-Based Unification of Several Alignment and Folding Algorithms
Weshowin this paper that manypopular models of folding and/or alignment maybe described by a new formalism: multi-tape S-attribute grammars(MTSAG's).This formalism relieves t...
Fabrice Lefebvre
AAECC
2006
Springer
120views Algorithms» more  AAECC 2006»
13 years 9 months ago
Continued fraction for formal laurent series and the lattice structure of sequences
Abstract Besides equidistribution properties and statistical independence the lattice profile, a generalized version of Marsaglia's lattice test, provides another quality meas...
Wilfried Meidl
MDAI
2007
Springer
14 years 2 months ago
Lindig's Algorithm for Concept Lattices over Graded Attributes
Formal concept analysis (FCA) is a method of exploratory data analysis. The data is in the form of a table describing relationship between objects (rows) and attributes (columns), ...
Radim Belohlávek, Bernard De Baets, Jan Out...
CAV
2005
Springer
101views Hardware» more  CAV 2005»
14 years 2 months ago
Algorithmic Algebraic Model Checking I: Challenges from Systems Biology
Carla Piazza, Marco Antoniotti, Venkatesh Mysore, ...
TYPES
2004
Springer
14 years 2 months ago
Extracting a Normalization Algorithm in Isabelle/HOL
We present a formalization of a constructive proof of weak normalization for the simply-typed λ-calculus in the theorem prover Isabelle/HOL, and show how a program can be extracte...
Stefan Berghofer