214 search results - page 2 / 43 » Perfect and Almost Perfect Sequences |
AAAI
2008
13 years 8 months ago
2008
Heuristic search using algorithms such as A and IDA is the prevalent method for obtaining optimal sequential solutions for classical planning tasks. Theoretical analyses of these ...
AFRICACRYPT
2010
Springer
13 years 11 months ago
2010
Springer
WG
2001
Springer
13 years 10 months ago
2001
Springer
We call an edge e of a perfect graph G critical if G − e is imperfect and say further that e is anticritical with respect to the complementary graph G. We ask in which perfect gr...
GCB
2006
Springer
13 years 10 months ago
2006
Springer
: Despite many years of research on how to properly align sequences in the presence of sequencing errors, alternative splicing and micro-exons, the correct alignment of mRNA sequen...
FSE
1999
Springer
13 years 10 months ago
1999
Springer
We study the functions from Fm 2 into Fm 2 for odd m which oppose an optimal resistance to linear cryptanalysis. These functions are called almost bent. It is known that almost ben...