Sciweavers

1376 search results - page 59 / 276
» Searching Trees: An Essay
Sort
View
EUROGP
2010
Springer
330views Optimization» more  EUROGP 2010»
15 years 6 months ago
Bandit-Based Genetic Programming
We consider the validation of randomly generated patterns in a Monte-Carlo Tree Search program. Our bandit-based genetic programming (BGP) algorithm, with proved mathematical prope...
Jean-Baptiste Hoock, Olivier Teytaud
DAM
2008
68views more  DAM 2008»
14 years 12 months ago
Parameterized algorithmics for linear arrangement problems
We discuss different variants of linear arrangement problems from a parameterized perspective. More specifically, we concentrate on developing simple search tree algorithms for th...
Henning Fernau
ESA
2000
Springer
73views Algorithms» more  ESA 2000»
15 years 3 months ago
K-D Trees Are Better when Cut on the Longest Side
We show that a popular variant of the well known k-d tree data structure satisfies an important packing lemma. This variant is a binary spatial partitioning tree T defined on a set...
Matthew Dickerson, Christian A. Duncan, Michael T....
STOC
1996
ACM
118views Algorithms» more  STOC 1996»
15 years 4 months ago
Towards an Analysis of Local Optimization Algorithms
We introduce a variant of Aldous and Vazirani's \Go with the winners" algorithm that can be used for search graphs that are not trees. We analyze the algorithm in terms ...
Tassos Dimitriou, Russell Impagliazzo
KDD
2009
ACM
183views Data Mining» more  KDD 2009»
16 years 12 days ago
OLAP on search logs: an infrastructure supporting data-driven applications in search engines
Search logs, which contain rich and up-to-date information about users' needs and preferences, have become a critical data source for search engines. Recently, more and more ...
Bin Zhou 0002, Daxin Jiang, Jian Pei, Hang Li