Almost Optimal Exploration in Multi-Armed Bandits Zohar Karnin Yahoo! Labs, Haifa, Israel Tomer Koren† Technion—Israel Institute of Technology, Haifa, Israel

Source URL: jmlr.org

• Mathematics
• Computational complexity theory
• Mathematical analysis
• Machine learning
• Multi-armed bandit
• Stochastic optimization
• Algorithm
• Exponential time hypothesis
• Big O notation

Benchmarking SAT Solvers for Bounded Model Checking Emmanuel Zarpas IBM Haifa Research Laboratory, Abstract. Modern SAT solvers are highly dependent on heuristics.

Source URL: researchweb.watson.ibm.com

Supplemental Material For the article “When Second Best is Good Enough: Another Probabilistic Look at Saturation Mutagenesis” In this document it is proven that the complements of the events Dj = “the jth-best vari

Source URL: stat.haifa.ac.il

1030 Biometrical Journal, 1030–1046

Source URL: stat.haifa.ac.il

A Support Vector Method for Clustering AsaBen-Hur Faculty of IE and Management Technion, Haifa 32000, Israel

Source URL: papers.nips.cc

J. Appl. Prob. 50, 1044–Printed in England © Applied Probability Trust 2013 SOJOURN TIME ESTIMATION IN AN M/G/∞ QUEUE WITH PARTIAL INFORMATION

Source URL: stat.haifa.ac.il

On Cartesian Trees, Lowest Common Ancestors, and Range Minimum Queries6

Source URL: cs.haifa.ac.il

Supporting Information Table 1: Bacterial strains, plasm ids, genes and primers. Relevant characteristics Reference or source

Source URL: stat.haifa.ac.il

DVIR, KOPPARTY, SARAF, AND SUDAN ON THE SIZE OF KAKEYA SETS IN FINITE FIELDS AN EXPOSITION BY VSEVOLOD F. LEV A Kakeya, or Besicovitch, set in a vector space is a set which contains a line in every direction. The finite

Source URL: math.haifa.ac.il

Hippos Third Season of Excavations July 2002 Arthur Segal University of Haifa

Source URL: hippos.haifa.ac.il