Sciweavers

14161 search results - page 269 / 2833
» On generalized middle-level problem
Sort
View
CP
2006
Springer
15 years 10 months ago
A Simple Distribution-Free Approach to the Max k-Armed Bandit Problem
The max k-armed bandit problem is a recently-introduced online optimization problem with practical applications to heuristic search. Given a set of k slot machines, each yielding p...
Matthew J. Streeter, Stephen F. Smith
GECCO
2006
Springer
163views Optimization» more  GECCO 2006»
15 years 10 months ago
The quadratic multiple knapsack problem and three heuristic approaches to it
The quadratic multiple knapsack problem extends the quadratic knapsack problem with K knapsacks, each with its own capacity Ck. A greedy heuristic fills the knapsacks one at a tim...
Amanda Hiley, Bryant A. Julstrom
AAAI
2008
15 years 9 months ago
Phase Transitions and Complexity of Weighted Satisfiability and Other Intractable Parameterized Problems
The study of random instances of NP complete and coNP complete problems has had much impact on our understanding of the nature of hard problems. In this work, we initiate an effor...
Yong Gao
CORR
2010
Springer
125views Education» more  CORR 2010»
15 years 6 months ago
Local search for stable marriage problems with ties and incomplete lists
The stable marriage problem has a wide variety of practical applications, ranging from matching resident doctors to hospitals, to matching students to schools, or more generally to...
Mirco Gelain, Maria Silvia Pini, Francesca Rossi, ...
CORR
2011
Springer
202views Education» more  CORR 2011»
15 years 1 months ago
Online Least Squares Estimation with Self-Normalized Processes: An Application to Bandit Problems
The analysis of online least squares estimation is at the heart of many stochastic sequential decision-making problems. We employ tools from the self-normalized processes to provi...
Yasin Abbasi-Yadkori, Dávid Pál, Csa...