Results 261 to 270 of about 33,492 (302)
Some of the next articles are maybe not open access.
Cover-based combinatorial bounds on probability of overfitting
Doklady Mathematics, 2014zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Frey, A. I., Tolstikhin, I. O.
openaire +1 more source
On the probabilities of moderate deviations for combinatorial sums
Vestnik St. Petersburg University: Mathematics, 2015zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire +2 more sources
Probability evolutionary algorithm for functional and combinatorial optimization
2008 7th World Congress on Intelligent Control and Automation, 2008A novel evolutionary algorithm called probability evolutionary algorithm (PEA) is proposed, which is inspired by the quantum computation and quantum-inspired evolutionary algorithm (QEA). The individual in PEA is encoded by a probabilistic superposed bit which can represent a linear superposition of the states 0 to k (k ges 1).
null Shuhan Shen, null Yuncai Liu
openaire +1 more source
Probably Approximately Efficient Combinatorial Auctions via Machine Learning
Proceedings of the AAAI Conference on Artificial Intelligence, 2017A well-known problem in combinatorial auctions (CAs) is that the value space grows exponentially in the number of goods, which often puts a large burden on the bidders and on the auctioneer. In this paper, we introduce a new design paradigm for CAs based on machine learning (ML).
Gianluca Brero +2 more
openaire +1 more source
Combinatorial foundations of information theory and the calculus of probabilities
Russian Mathematical Surveys, 1983This paper gives a general view of a foundation of probability theory that is alternative to that on general measure theory. Examples are given that show that information-theoretic results follow from purely combinatorial arguments. Then the complexity of an object is defined as the length of the shortest binary sequence of 0's and 1's that is required
openaire +2 more sources
Distance-Based Exponential Probability Models for Constrained Combinatorial Problems
2018Estimation of Distribution Algorithms (EDAs) have already demonstrated their utility when solving a broad range of combinatorial problems. However, there is still room for methodological improvement when approaching problems with constraints. The great majority of works in the literature implement repairing or penalty schemes, or use ad-hoc sampling ...
Josu Ceberio +2 more
openaire +1 more source
Geometric and combinatorial properties of the polytope of binary choice probabilities
Mathematical Social Sciences, 1992A system of binary choice probabilities on a finite set is representable if the probabilities are compatible with a probability distribution over the family of linear orders of the set. In geometric terms representable binary choice probabilities form a polytope the vertices of which correspond to the permutations in a matrix indicating the dominant ...
openaire +2 more sources
Combinatorial problems of probability theory
Journal of Soviet Mathematics, 1975Kolchin, V. F., Chistyakov, V. P.
openaire +1 more source
The Combinatorial Foundations of Information Theory and the Probability Calculus
1993I should like to begin with some considerations which go beyond the framework of the main topic of my report. Mathematics formalized according to Hilbert is nothing other than the theory of operations on schemes of special form consisting of a finite number of symbols disposed in a certain order and related by various connections.
openaire +1 more source