Results 21 to 30 of about 1,884,911 (319)
An Efficient Algorithm for Rare-event Probability Estimation, Combinatorial Optimization, and Counting [PDF]
Methodology and Computing in Applied Probability, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Botev, Z. I., Kroese, D. P.
openaire +4 more sources
Precedence probability, prediction interval and a combinatorial identity
, 1998 Precedence tests are simple yet useful nonparametric tests based on two specified order statistics from independent random samples or, equivalently, on the count of the number of observations from one of the samples preceding some order statistic of the other sample.
S. Chakraborti, van der P Paul Laan
openalex +3 more sources
Irreducibility of combinatorial objects : asymptotic probability and interpretation
, 2022 In our investigation, we deal with various combinatorial objects. Some of them are irreducible, others are built from irreducible ones, either using combinatorial constructions within the symbolic method or with the help of composition within the theory of species.
Khaydar Nurligareev
openalex +3 more sources
Distance-based exponential probability models on constrained combinatorial optimization problems [PDF]
Proceedings of the Genetic and Evolutionary Computation Conference Companion, 2018 Estimation of distribution algorithms have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvements when approaching constrained type problems. The great majority of works in the literature implement external repairing or penalty schemes, or use ad-hoc sampling
Josu Ceberio +2 more
openalex +3 more sources
Combinatorial problems of probability theory [PDF]
Journal of Soviet Mathematics, 1975 V. F. Kolchin, V. P. Chistyakov
openalex +2 more sources
A refinement of the Sylvester problem: Probabilities of combinatorial types [PDF]
Let $X_1,\ldots, X_{d+2}$ be random points in $\mathbb R^d$. The classical Sylvester problem asks to determine the probability that the convex hull of these points, denoted by $P:= [X_1,\ldots, X_{d+2}]$, is a simplex. In the present paper, we study a refined version of this problem which asks to determine the probability that $P$ has a given ...
Zakhar Kabluchko, Hugo Panzo
openalex +3 more sources
Contextual Combinatorial Bandits with Probabilistically Triggered Arms [PDF]
International Conference on Machine Learning, 2023 We study contextual combinatorial bandits with probabilistically triggered arms (C$^2$MAB-T) under a variety of smoothness conditions that capture a wide range of applications, such as contextual cascading bandits and contextual influence maximization ...
Xutong Liu +6 more
semanticscholar +1 more source
Combinatorial Contracts Beyond Gross Substitutes [PDF]
ACM-SIAM Symposium on Discrete Algorithms, 2023 We study the combinatorial contracting problem of D\"utting et al. [FOCS '21], in which a principal seeks to incentivize an agent to take a set of costly actions.
Paul Dütting +2 more
semanticscholar +1 more source
IEEE Annual Symposium on Foundations of Computer Science, 2021 We introduce a new model of combinatorial contracts in which a principal delegates the execution of a costly task to an agent. To complete the task, the agent can take any subset of a given set of unobservable actions, each of which has an associated ...
Paul Dütting +3 more
semanticscholar +1 more source
Exactly Solvable Balanced Tenable Urns with Random Entries via the Analytic Methodology [PDF]
Discrete Mathematics & Theoretical Computer Science, 2012 This paper develops an analytic theory for the study of some Pólya urns with random rules. The idea is to extend the isomorphism theorem in Flajolet et al.
Basile Morcrette, Hosam M. Mahmoud
doaj +1 more source