472 search results - page 44 / 95 » Design of Iterated Local Search Algorithms |
109
Voted
ACG
2003
Springer
15 years 7 months ago
2003
Springer
We present a new method for taking advantage of the relative independence between parts of a single-player game. We describe an implementation for improving the search in a solitai...
126
click to vote
KCAP
2005
ACM
15 years 8 months ago
2005
ACM
This paper proposes an ontology mapping based framerowk that allows searching for web resources using multiple ontologies. The proposed solution uses a mapping ontology that is a ...
127
click to vote
BMCBI
2007
15 years 2 months ago
2007
Background: To infer homology and subsequently gene function, the Smith-Waterman (SW) algorithm is used to find the optimal local alignment between two sequences. When searching s...
102
click to vote
WWW
2006
ACM
16 years 3 months ago
2006
ACM
Contextual search refers to proactively capturing the information need of a user by automatically augmenting the user query with information extracted from the search context; for...
112
click to vote
TCBB
2008
15 years 2 months ago
2008
Abstract-- The Maximum Parsimony problem aims at reconstructing a phylogenetic tree from DNA sequences while minimizing the number of genetic transformations. To solve this NP-comp...