4229 search results - page 123 / 846 » On the Optimality of Spiral Search |
136
click to vote
AAAI
2000
15 years 2 months ago
2000
Depth-first branch-and-bound (DFBnB) is a complete algorithm that is typically used to find optimal solutions of difficult combinatorial optimization problems. It can also be adap...
IPPS
2009
IEEE
15 years 8 months ago
2009
IEEE
In this paper we present the results of parallelizing two life sciences applications, Markov random fieldsbased (MRF) liver segmentation and HMMER’s Viterbi algorithm, using GP...
117
click to vote
SEMWEB
2010
Springer
14 years 11 months ago
2010
Springer
Abstract. Much of the research on automated Web Service Composition (WSC) relates it to an AI planning task, where the composition is primarily done offline prior to execution. Rec...
109
click to vote
GECCO
2005
Springer
15 years 6 months ago
2005
Springer
This paper is concerned with a specific brand of evolutionary algorithms: Memetic algorithms. A new local search technique with an adaptive neighborhood setting process is introdu...
GECCO
2006
Springer
15 years 5 months ago
2006
Springer
This paper proposes a hybrid genetic algorithm for multiple sequence alignment. The algorithm evolves guide sequences and aligns input sequences based on the guide sequences. It a...