Sciweavers

1263 search results - page 129 / 253
» A* with Bounded Costs
Sort
View
SIAMCOMP
2002
124views more  SIAMCOMP 2002»
13 years 9 months ago
The Nonstochastic Multiarmed Bandit Problem
Abstract. In the multiarmed bandit problem, a gambler must decide which arm of K nonidentical slot machines to play in a sequence of trials so as to maximize his reward. This class...
Peter Auer, Nicolò Cesa-Bianchi, Yoav Freun...
SIAMDM
2002
94views more  SIAMDM 2002»
13 years 9 months ago
How to Be an Efficient Snoop, or the Probe Complexity of Quorum Systems
A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mu...
David Peleg, Avishai Wool
DAM
2011
13 years 4 months ago
On minimal Sturmian partial words
Partial words, which are sequences that may have some undefined positions called holes, can be viewed as sequences over an extended alphabet A = A ∪ { }, where stands for a hol...
Francine Blanchet-Sadri, John Lensmire
SIAMSC
2011
177views more  SIAMSC 2011»
13 years 4 months ago
Computing f(A)b via Least Squares Polynomial Approximations
Given a certain function f, various methods have been proposed in the past for addressing the important problem of computing the matrix-vector product f(A)b without explicitly comp...
Jie Chen, Mihai Anitescu, Yousef Saad
SIAMMA
2010
90views more  SIAMMA 2010»
13 years 4 months ago
A General Proximity Analysis of Nonlinear Subdivision Schemes
In recent work nonlinear subdivision schemes which operate on manifold-valued data have been successfully analyzed with the aid of so-called proximity conditions bounding the diffe...
Philipp Grohs