2905 search results - page 238 / 581 » Formal Memetic Algorithms |
154
click to vote
CAV
2005
Springer
16 years 6 days ago
2005
Springer
Abstract. The coverability problem is decidable for the class of wellstructured transition systems. Until recently, the only known algorithm to solve this problem was based on symb...
154
click to vote
ECSQARU
2005
Springer
16 years 6 days ago
2005
Springer
In this paper we explore the use of several types of structural restrictions within algorithms for learning Bayesian networks. These restrictions may codify expert knowledge in a g...
154
click to vote
CRYPTO
2004
Springer
16 years 1 days ago
2004
Springer
In this paper we study the long standing problem of information extraction from multiple linear approximations. We develop a formal statistical framework for block cipher attacks b...
219
click to vote
ECAI
2004
Springer
16 years 1 days ago
2004
Springer
The Hierarchical Hidden Markov Model (HHMM) is a well formalized tool suitable to model complex patterns in long temporal or spatial sequences. Even if effective algorithms are ava...
182
click to vote
COCO
2000
Springer
15 years 11 months ago
2000
Springer
Kolmogorov’s very first paper on algorithmic information theory (Kolmogorov, Problemy peredachi infotmatsii 1(1) (1965), 3) was entitled “Three approaches to the definition ...