Probability-boosting technique for combinatorial optimization [PDF]
PeerJ Computer ScienceIn many combinatorial optimization problems we want a particular set of k out of n items with some certain properties (or constraints). These properties may involve the k items.
Sanpawat Kantabutra
doaj +5 more sources
Extremal Probability Bounds in Combinatorial Optimization [PDF]
SIAM Journal on Optimization, 2021 In this paper, we compute the tightest possible bounds on the probability that the optimal value of a combinatorial optimization problem in maximization form with a random objective exceeds a given number, assuming only knowledge of the marginal distributions of the objective coefficient vector.
Divya Padmanabhan +3 more
openaire +6 more sources
Discrete Bayesian Inference as a Structure of Paths [PDF]
EntropyBayesian inference is predominantly formulated in a continuous framework, in which posterior beliefs are represented by smooth probability densities.
Valerian V. Popkov
doaj +2 more sources
Near-medians that avoid the corners; a combinatorial probability approach. [PDF]
BMC Genomics, 2014 The breakpoint median for a set of k ≥ 3 random genomes tends to approach (any) one of these genomes ("corners") as genome length increases, although there are diminishing proportion of medians equidistant from all k ("medians in the middle"). Algorithms are likely to miss the latter, and this has consequences for the general case where input genomes ...
Larlee C, Zheng C, Sankoff D.
europepmc +4 more sources
Generating Functions for New Families of Combinatorial Numbers and Polynomials: Approach to Poisson–Charlier Polynomials and Probability Distribution Function [PDF]
Axioms, 2019 The aim of this paper is to construct generating functions for new families of combinatorial numbers and polynomials. By using these generating functions with their functional and differential equations, we not only investigate properties of these new ...
Irem Kucukoglu +2 more
doaj +2 more sources
Improved Combinatorial Approximations for Weighted Correlation Clustering [PDF]
Discrete Mathematics & Theoretical Computer ScienceWe present combinatorial approximation algorithms for the weighted correlation clustering problem. In this problem, we have a set of vertices and two weight values for each pair of vertices, denoting their difference and similarity.
Mojtaba Ostovari, Alireza Zarei
doaj +2 more sources
The RNA-First Fallacy: Conflating Evolutionary Ancestry with Prebiotic Primacy [PDF]
LifeThe RNA-World hypothesis remains the most widely accepted framework in origins-of-life research, anchored in compelling biochemical evidence for RNA’s deep evolutionary ancestry.
Amit Kahana
doaj +2 more sources
SamplingDesign: RNA design via continuous optimization with coupled variables and Monte-Carlo sampling [PDF]
Nature CommunicationsRNA design aims to find a sequence that can fold into a target secondary structure. It can create artificial RNA molecules for specific functions, with wide applications in medicine.
Wei Yu Tang +4 more
doaj +2 more sources
Combinatorial probability interpretation of certain modified orthogonal polynomials
European Journal of Combinatorics, 2008 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Charalambides, Charalambos A. +1 more
openaire +3 more sources
Probability and Problems in Euclidean Combinatorial Optimization
Statistical Science, 1993 This article summarizes the current status of several streams of research that deal with the probability theory of problems of combina- torial optimization. There is a particular emphasis on functionals of finite point sets. The most famous example of such functionals is the length associated with the Euclidean traveling salesman problem (TSP), but ...
Steele, John M
openaire +5 more sources