Related papers: The cocked hat
The combinatorial stochastic semi-bandit problem is an extension of the classical multi-armed bandit problem in which an algorithm pulls more than one arm at each stage and the rewards of all pulled arms are revealed. One difference with…
We consider the wave equation in a bounded domain (eventually convex). Two kinds of inequality are described when occurs trapped ray. Applications to control theory are given. First, we link such kind of estimate with the damped wave…
Two approaches to the old problem of the so-called "knee" in cosmic ray spectrum are compared with the existing experimental data. It is shown that "standard astrophysical model" of the knee is not supported by some experimental data, while…
The Inverse 3-SAT problem is known to be coNP Complete. This article shows a new interesting way to solve directly the problem by using closure under resolution and partial assignment properties. An algorithm is proposed which lets solve…
We introduce a new decision problem, called Packed Interval Covering (PIC) and show that it is NP-complete.
Recently, a number of statistical problems have found an unexpected solution by inspecting them through a "modal point of view". These include classical tasks such as clustering or regression. This has led to a renewed interest in…
One-dimensional optical waveguiding is revisited using the electromagnetic deduction of Fresnel formulas relating the incident, reflected, and transmitted waves on the abrupt interface between two different optical media. Throughout the…
The safe linear bandit problem is a version of the classical stochastic linear bandit problem where the learner's actions must satisfy an uncertain constraint at all rounds. Due its applicability to many real-world settings, this problem…
We survey some of our recent results on inverse problems for evolution equations. The goal is to provide a unified approach to solve various types of evolution equations. The inverse problems we consider consist in determining unknown…
Would it be possible to automatically associate ancient pictures to modern ones and create fancy cultural heritage city maps? We introduce here the task of recognizing the location depicted in an old photo given modern annotated images…
Geopositioning and tracking a moving boat at sea is a very challenging problem, requiring boat detection, matching and estimating its GPS location from imagery with no common features. The problem can be stated as follows: given imagery…
We study the recovering bandits problem, a variant of the stochastic multi-armed bandit problem where the expected reward of each arm varies according to some unknown function of the time since the arm was last played. While being a natural…
Problem 1325 from the journal Crux Mathematicorum is revisited, and a new solution is presented.
A puzzle about prisoners trying to identify the color of a hat on their head leads to a version where there are k more hats than prisoners. This generalized puzzle is related to the independence number of the arrangement graph A(m, n) and…
By carrying out refined curvature estimates, we prove better rigidity theorems of complete noncompact ancient solutions to the mean curvature flow in higher codimension under various Gauss image restriction.
Writing an uncomplicated, robust, and scalable three-dimensional convex hull algorithm is challenging and problematic. This includes, coplanar and collinear issues, numerical accuracy, performance, and complexity trade-offs. While there are…
If time travel is possible, it seems to inevitably lead to paradoxes. These include consistency paradoxes, such as the famous grandfather paradox, and bootstrap paradoxes, where something is created out of nothing. One proposed class of…
The reader is reminded of several puzzles involving randomness. These may be ill-posed, and if well-posed there is sometimes a solution that uses probabilistic intuition in a special way. Various examples are presented including the well…
This is a survey of select recent results by a number of authors, inspired by the classical configuration theorems of projective geometry.
The orienteering problem (OP) is a combinatorial optimization problem that seeks a path visiting a subset of locations to maximize collected rewards under a limited resource budget. This article presents a systematic PRISMA-based review of…