Sciweavers

1529 search results - page 94 / 306
» Search Space Analysis of the Linear Ordering Problem
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
15 years 4 months ago
Gaussian Process Bandits for Tree Search
We motivate and analyse a new Tree Search algorithm, based on recent advances in the use of Gaussian Processes for bandit problems. We assume that the function to maximise on the ...
Louis Dorard, John Shawe-Taylor
DKE
2002
107views more  DKE 2002»
15 years 3 months ago
View selection using randomized search
An important issue in data warehouse development is the selection of a set of views to materialize in order to accelerate OLAP queries, given certain space and maintenance time co...
Panos Kalnis, Nikos Mamoulis, Dimitris Papadias
AAAI
2006
15 years 5 months ago
A Direct Evolutionary Feature Extraction Algorithm for Classifying High Dimensional Data
Among various feature extraction algorithms, those based on genetic algorithms are promising owing to their potential parallelizability and possible applications in large scale an...
Qijun Zhao, David Zhang, Hongtao Lu
TROB
2010
127views more  TROB 2010»
15 years 2 months ago
Motion Planning With Dynamics by a Synergistic Combination of Layers of Planning
—To efficiently solve challenging motion-planning problems with dynamics, this paper proposes treating motion planning not just as a search problem in a continuous space but as ...
Erion Plaku, Lydia E. Kavraki, Moshe Y. Vardi
AAAI
1998
15 years 5 months ago
"Squeaky Wheel" Optimization
We describe a general approach to optimization which we term Squeaky Wheel" Optimization SWO. In SWO, a greedy algorithm is used to construct a solution which is then analyze...
David Joslin, David P. Clements