Sciweavers

12 search results - page 1 / 3
» Towards the decathlon challenge of search heuristics
Sort
View
GECCO
2009
Springer
13 years 9 months ago
Towards the decathlon challenge of search heuristics
Edmund K. Burke, Timothy Curtois, Graham Kendall, ...
NIPS
2007
13 years 6 months ago
Theoretical Analysis of Heuristic Search Methods for Online POMDPs
Planning in partially observable environments remains a challenging problem, despite significant recent advances in offline approximation techniques. A few online methods have a...
Stéphane Ross, Joelle Pineau, Brahim Chaib-...
SIGIR
2012
ACM
11 years 7 months ago
Automatic suggestion of query-rewrite rules for enterprise search
Enterprise search is challenging for several reasons, notably the dynamic terminology and jargon that are specific to the enterprise domain. This challenge is partly addressed by...
Zhuowei Bao, Benny Kimelfeld, Yunyao Li
CEC
2010
IEEE
13 years 5 months ago
Iterated local search vs. hyper-heuristics: Towards general-purpose search algorithms
An important challenge within hyper-heuristic research is to design search methodologies that work well, not only across different instances of the same problem, but also across di...
Edmund K. Burke, Timothy Curtois, Matthew R. Hyde,...
DEXA
2007
Springer
150views Database» more  DEXA 2007»
13 years 10 months ago
Sequence Alignment as a Database Technology Challenge
Abstract. Sequence alignment is an important task for molecular biologists. Because alignment basically deals with approximate string matching on large biological sequence collecti...
Hans Philippi