Zobrazeno 1 - 10
of 51
pro vyhledávání: '"Krityakierne, Tipaluck"'
John von Neumann studied a simplified version of poker where the "deck" consists of infinitely many cards, in fact, all real numbers between $0$ and $1$. We harness the power of computation, both numeric and symbolic, to investigate analogs with fini
Externí odkaz:
http://arxiv.org/abs/2407.16155
In the classical coupon collector's problem, every box of breakfast cereal contains one coupon from a collection of n distinct coupons, each equally likely to appear. The goal is to find the expected number of boxes a player needs to purchase to comp
Externí odkaz:
http://arxiv.org/abs/2211.04374
Autor:
Krityakierne, Tipaluck, Siriputcharoen, Poohrich, Thanatipanonda, Thotsaporn Aek, Yapolha, Chaloemkiat
Relying on the optimal guessing strategy recently found for a no-feedback card guessing game with $k$-time riffle shuffles, we derive an exact, closed-form formula for the expected number of correct guesses and higher moments for a $1$-time shuffle c
Externí odkaz:
http://arxiv.org/abs/2209.04276
In 1998, Ciucu published "No-feedback card guessing for dovetail shuffles", an article which gives the optimal guessing strategy for $n$ cards ($n$ even) after $k$ riffle shuffles whenever $k>2\log_{2}\left(n\right)$. We discuss in this article the o
Externí odkaz:
http://arxiv.org/abs/2205.08793
Given a sequence 1, 1, 5, 23, 135, 925, 7285, 64755, 641075, 6993545, 83339745,..., how can we guess a formula for it? This article will quickly walk you through the concept of ansatz for classes of polynomial, $C$-finite, holonomic, and the most rec
Externí odkaz:
http://arxiv.org/abs/2201.08035
Consider a card guessing game with complete feedback in which a deck of $n$ cards ordered $1,\dots, n$ is riffle-shuffled once. With the goal to maximize the number of correct guesses, a player guesses cards from the top of the deck one at a time und
Externí odkaz:
http://arxiv.org/abs/2107.11142
Publikováno v:
In Information Processing in Agriculture April 2024
We focus on kernel methods for set-valued inputs and their application to Bayesian set optimization, notably combinatorial optimization. We investigate two classes of set kernels that both rely on Reproducing Kernel Hilbert Space embeddings, namely t
Externí odkaz:
http://arxiv.org/abs/1910.04086
Publikováno v:
In Journal of Symbolic Computation March-April 2023 115:1-17
Publikováno v:
In Operations Research Perspectives 2020 7