202 search results - page 24 / 41 » Complexity of local search for the p-median problem |
137
click to vote
AAAI
2006
15 years 7 months ago
2006
This paper considers strategies for external memory based optimal planning. An external breadth-first search exploration algorithm is devised that is guaranteed to find the costop...
173
click to vote
FGCS
2007
15 years 6 months ago
2007
Solving the structure prediction problem for complex proteins is difficult and computationally expensive. In this paper, we propose a bicriterion parallel hybrid genetic algorith...
156
Voted
EVOW
2007
Springer
16 years 8 days ago
2007
Springer
In this paper we study a complex real-world workforce scheduling problem. We propose a method of splitting the problem into smaller parts and solving each part using exhaustive sea...
162
click to vote
IJCNN
2006
IEEE
16 years 3 days ago
2006
IEEE
— A heuristic is proposed to address free parameter selection for Support Vector Machines, with the goals of improving generalization performance and providing greater insensitiv...
190
click to vote
BIBE
2008
IEEE
16 years 17 days ago
2008
IEEE
— The Smith-Waterman algorithm is a dynamic programming method for determining optimal local alignments between nucleotide or protein sequences. However, it suffers from quadrati...