Sciweavers

1795 search results - page 117 / 359
» Search by strategy
Sort
View
GECCO
2007
Springer
176views Optimization» more  GECCO 2007»
16 years 16 days ago
Best SubTree genetic programming
The result of the program encoded into a Genetic Programming (GP) tree is usually returned by the root of that tree. However, this is not a general strategy. In this paper we pres...
Oana Muntean, Laura Diosan, Mihai Oltean
ECIR
2009
Springer
16 years 3 months ago
Organizing Suggestions in Autocompletion Interfaces
We describe two user studies that investigate organization strategies of autocompletion in a known-item search task: searching for terms taken from a thesaurus. In Study 1, we expl...
Alia Amin, Michiel Hildebrand, Jacco van Ossenbrug...
TCIAIG
2010
15 years 1 months ago
Monte Carlo Tree Search in Hex
Hex, the classic board game invented by Piet Hein in 1942 and independently by John Nash in 1948, has been a domain of artificial intelligence research since Claude Shannon's ...
Broderick Arneson, Ryan B. Hayward, Philip Henders...
GECCO
2006
Springer
151views Optimization» more  GECCO 2006»
15 years 10 months ago
Neighbourhood searches for the bounded diameter minimum spanning tree problem embedded in a VNS, EA, and ACO
We consider the Bounded Diameter Minimum Spanning Tree problem and describe four neighbourhood searches for it. They are used as local improvement strategies within a variable nei...
Martin Gruber, Jano I. van Hemert, Günther R....
JIS
2008
119views more  JIS 2008»
15 years 5 months ago
A three-year study on the freshness of web search engine databases
This paper deals with one aspect of the index quality of search engines: index freshness. The purpose is to analyse the update strategies of the major Web search engines Google, Y...
Dirk Lewandowski