Sciweavers

2880 search results - page 165 / 576
» Approximate Range Searching
Sort
View
132
Voted
AI
2003
Springer
15 years 8 months ago
Hybrid Randomised Neighbourhoods Improve Stochastic Local Search for DNA Code Design
Sets of DNA strands that satisfy combinatorial constraints play an important role in various approaches to biomolecular computation, nanostructure design, and molecular tagging. Th...
Dan C. Tulpan, Holger H. Hoos
130
Voted
IJCAI
1989
15 years 4 months ago
The Reason for the Benefits of Minimax Search
based on an abstract concept of quiescence. In the following we sketch this and a related model, describe the design of our experiments, and present the results of our simulation s...
Anton Scheucher, Hermann Kaindl
118
Voted
BMCBI
2008
105views more  BMCBI 2008»
15 years 3 months ago
Objective and automated protocols for the evaluation of biomedical search engines using No Title Evaluation protocols
Background: The evaluation of information retrieval techniques has traditionally relied on human judges to determine which documents are relevant to a query and which are not. Thi...
Fabien Campagne
220
Voted
IR
2008
15 years 3 months ago
Output-sensitive autocompletion search
We consider the following autocompletion search scenario: imagine a user of a search engine typing a query; then with every keystroke display those completions of the last query wo...
Holger Bast, Christian Worm Mortensen, Ingmar Webe...
131
Voted
JCST
2008
134views more  JCST 2008»
15 years 3 months ago
Orthogonal Methods Based Ant Colony Search for Solving Continuous Optimization Problems
Research into ant colony algorithms for solving continuous optimization problems forms one of the most significant and promising areas in swarm computation. Although traditional an...
Xiaomin Hu, Jun Zhang, Yun Li