1259 search results - page 31 / 252 » In search of the memoryless property |
PPSN
2000
Springer
13 years 11 months ago
2000
Springer
This work introduces a general mathematical framework for non-stationary fitness functions which enables the exact definition of certain problem properties. The properties' in...
LATIN
2010
Springer
14 years 2 months ago
2010
Springer
The working-set bound [Sleator and Tarjan, J. ACM, 1985] roughly states that searching for an element is fast if the element was accessed recently. Binary search trees, such as sp...
SISAP
2008
IEEE
14 years 2 months ago
2008
IEEE
Similarity search in sequence databases is of paramount importance in bioinformatics research. As the size of the genomic databases increases, similarity search of proteins in the...
ICTAI
2006
IEEE
14 years 1 months ago
2006
IEEE
Traditional global search heuristics to solve constraint satisfaction problems focus on properties of an individual variable that mandate early search attention. If, however, one ...
GCB
1997
Springer
13 years 12 months ago
1997
Springer
Motivation: Database search programs such as FASTA, BLAST or a rigorous Smith–Waterman algorithm produce lists of database entries, which are assumed to be related to the query....