Sciweavers

532 search results - page 23 / 107
» Tree exploration with advice
Sort
View
CORR
2010
Springer
174views Education» more  CORR 2010»
13 years 7 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
VIS
2004
IEEE
116views Visualization» more  VIS 2004»
14 years 8 months ago
Simplifying Flexible Isosurfaces Using Local Geometric Measures
our tree, an abstraction of a scalar field that encodes the nesting relationships of isosurfaces, can be used to accelerate isosurface extraction, to identify important isovalues ...
Hamish Carr, Jack Snoeyink, Michiel van de Panne
ANTSW
2004
Springer
14 years 29 days ago
Search Bias in Constructive Metaheuristics and Implications for Ant Colony Optimisation
Constructive metaheuristics explore a tree of constructive decisions, the topology of which is determined by the way solutions are represented and constructed. Some solution repres...
James Montgomery, Marcus Randall, Tim Hendtlass
IUI
2009
ACM
14 years 4 months ago
Learning to recognize valuable tags
Many websites use tags as a mechanism for improving item metadata through collective user effort. Users of tagging systems often apply far more tags to an item than a system can ...
Shilad Sen, Jesse Vig, John Riedl
RTCSA
2009
IEEE
14 years 2 months ago
Branch Target Buffers: WCET Analysis Framework and Timing Predictability
—One step in the verification of hard real-time systems is to determine upper bounds on the worst-case execution times (WCET) of tasks. To obtain tight bounds, a WCET analysis h...
Daniel Grund, Jan Reineke, Gernot Gebhard