749 search results - page 27 / 150 » Combinatory Models and Symbolic Computation |
SARA
2009
Springer
14 years 4 months ago
2009
Springer
Equidistant Frequency Permutation Arrays are combinatorial objects of interest in coding theory. A frequency permutation array is a type of constant composition code in which each...
PPSN
2004
Springer
14 years 3 months ago
2004
Springer
It is typical for the EA community that theory follows experiments. Most theoretical approaches use some model of the considered evolutionary algorithm (EA) but there is also some ...
IICAI
2007
13 years 11 months ago
2007
Structured Hidden Markov Models (S-HMM) are a variant of Hierarchical Hidden Markov Models; it provides an abstraction mechanism allowing a high level symbolic description of the k...
COMPGEOM
2003
ACM
14 years 3 months ago
2003
ACM
We develop algorithms for computing the smallest enclosing ball of a set of n balls in d-dimensional space. Unlike previous methods, we explicitly address small cases (n ≤ d + 1...
SOFSEM
2009
Springer
14 years 6 months ago
2009
Springer
Petri nets are an effective formalism to model discrete event systems, and several variants have been defined to explicitly include real time in the model. We consider two fundam...