Approximately counting and sampling knowledge states
From MaRDI portal
Publication:6126887
Recommendations
Cites work
- A class of stochastic procedures for the assessment of knowledge
- A decomposition theorem for partially ordered sets
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries.
- A practical perspective on knowledge space theory: ALEKS and its data
- Almost connected orders
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Comparing sweep strategies for stochastic relaxation
- Handbook of Markov Chain Monte Carlo
- Handbook of Monte Carlo Methods
- scientific article; zbMATH DE number 5954252 (Why is no real title available?)
- scientific article; zbMATH DE number 1085989 (Why is no real title available?)
- scientific article; zbMATH DE number 2117879 (Why is no real title available?)
- scientific article; zbMATH DE number 795109 (Why is no real title available?)
- Knowledge Spaces
- Learning spaces. Interdisciplinary applied mathematics
- Markov Chains
- Markov Chains
- Monte Carlo strategies in scientific computing
- Multilevel splitting for estimating rare event probabilities
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- Random generation of combinatorial structures from a uniform distribution
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- Sampling-Based Approaches to Calculating Marginal Densities
- Sequential Monte Carlo for rare event estimation
- Spaces for the assessment of knowledge
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Well-graded families of relations
This page was built for publication: Approximately counting and sampling knowledge states
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6126887)
