Sciweavers

450 search results - page 18 / 90
» Adaptive Algorithms for Online Decision Problems
Sort
View
NIPS
2004
13 years 9 months ago
Nearly Tight Bounds for the Continuum-Armed Bandit Problem
In the multi-armed bandit problem, an online algorithm must choose from a set of strategies in a sequence of n trials so as to minimize the total cost of the chosen strategies. Wh...
Robert D. Kleinberg
MCS
2010
Springer
14 years 29 days ago
Online Non-stationary Boosting
Abstract. Oza’s Online Boosting algorithm provides a version of AdaBoost which can be trained in an online way for stationary problems. One perspective is that this enables the p...
Adam Pocock, Paraskevas Yiapanis, Jeremy Singer, M...
ASC
2004
13 years 7 months ago
Adaptive reconfiguration of data networks using genetic algorithms
Genetic algorithms are applied to an important, but little-investigated, network design problem, that of reconfiguring the topology and link capacities of an operational network t...
David J. Montana, Talib S. Hussain
ICDE
2008
IEEE
190views Database» more  ICDE 2008»
14 years 9 months ago
Adaptive Segmentation for Scientific Databases
In this paper we explore database segmentation in the context of a column-store DBMS targeted at a scientific database. We present a novel hardware- and scheme-oblivious segmentati...
Milena Ivanova, Martin L. Kersten, Niels Nes
AE
2007
Springer
14 years 2 months ago
Adaptive and Assortative Mating Scheme for Evolutionary Multi-Objective Algorithms
We are interested in the role of restricted mating schemes in the context of evolutionary multi-objective algorithms. In this paper, we propose an adaptive assortative mating schem...
Khoi Le, Dario Landa Silva