Sciweavers

12264 search results - page 207 / 2453
» An Analysis of the XSL Algorithm
Sort
View
ALT
2007
Springer
16 years 3 months ago
Tuning Bandit Algorithms in Stochastic Environments
Algorithms based on upper-confidence bounds for balancing exploration and exploitation are gaining popularity since they are easy to implement, efficient and effective. In this p...
Jean-Yves Audibert, Rémi Munos, Csaba Szepe...
ICASSP
2009
IEEE
16 years 1 months ago
A mixed time-scale algorithm for distributed parameter estimation : Nonlinear observation models and imperfect communication
Abstract— The paper considers the algorithm NLU for distributed (vector) parameter estimation in sensor networks, where, the local observation models are nonlinear, and inter-sen...
Soummya Kar, José M. F. Moura
JSSPP
2004
Springer
15 years 12 months ago
Reconfigurable Gang Scheduling Algorithm
 Using a single traditional gang scheduling algorithm cannot provide the best performance for all workloads and parallel architectures. A solution for this problem is the use of...
Luís Fabrício Wanderley Góes,...
ALGORITHMICA
2006
160views more  ALGORITHMICA 2006»
15 years 6 months ago
Combinatorial Algorithms for the Unsplittable Flow Problem
We provide combinatorial algorithms for the unsplittable flow problem (UFP) that either match or improve the previously best results. In the UFP we are given a (possibly directed)...
Yossi Azar, Oded Regev
GECCO
2005
Springer
126views Optimization» more  GECCO 2005»
16 years 2 hour ago
Not all linear functions are equally difficult for the compact genetic algorithm
Estimation of distribution algorithms (EDAs) try to solve an optimization problem by finding a probability distribution focussed around its optima. For this purpose they conduct ...
Stefan Droste