5316 search results - page 331 / 1064 » Which Search Problems Are Random |
216
click to vote
SSPR
2004
Springer
16 years 13 days ago
2004
Springer
This paper presents an optimized Hill Climbing algorithm to select a subset of features for handwritten character recognition. The search is conducted taking into account a random ...
209
click to vote
ERCIMDL
2010
Springer
15 years 4 months ago
2010
Springer
Extracting titles from a PDFs full text is an important task in information retrieval to identify PDFs. Existing approaches apply complicated and expensive (in terms of calculating...
199
click to vote
GECCO
2005
Springer
16 years 18 days ago
2005
Springer
Memetic algorithms have become to gain increasingly important for solving large scale combinatorial optimization problems. Typically, the extent of the application of local search...
157
click to vote
RECOMB
2003
Springer
16 years 7 months ago
2003
Springer
Large-scale comparison of genomic DNA is of fundamental importance in annotating functional elements of genomes. To perform large comparisons efficiently, BLAST (Methods: Companio...
257
click to vote
CP
2004
Springer
16 years 14 days ago
2004
Springer
The success of stochastic algorithms is often due to their ability to effectively amplify the performance of search heuristics. This is certainly the case with stochastic sampling ...