Approximately counting and sampling knowledge states
From MaRDI portal
Publication:6126887
DOI10.1111/bmsp.12257OpenAlexW3210197375MaRDI QIDQ6126887
Publication date: 10 April 2024
Published in: British Journal of Mathematical and Statistical Psychology (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1111/bmsp.12257
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Sequential Monte Carlo for rare event estimation
- Note on two necessary and sufficient axioms for a well-graded knowledge space
- Random generation of combinatorial structures from a uniform distribution
- Approximate counting, uniform generation and rapidly mixing Markov chains
- Comparing sweep strategies for stochastic relaxation
- Well-graded families of relations
- A practical perspective on knowledge space theory: ALEKS and its data
- A decomposition theorem for partially ordered sets
- Multilevel Splitting for Estimating Rare Event Probabilities
- Knowledge Spaces
- Learning Spaces
- Handbook of Monte Carlo Methods
- A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries
- Sampling-Based Approaches to Calculating Marginal Densities
- Handbook of Markov Chain Monte Carlo
- Stochastic Relaxation, Gibbs Distributions, and the Bayesian Restoration of Images
- Spaces for the assessment of knowledge
- Markov Chains
- Markov Chains
- Random Walks on Truncated Cubes and Sampling 0-1 Knapsack Solutions
- An $n^{5/2} $ Algorithm for Maximum Matchings in Bipartite Graphs
- A class of stochastic procedures for the assessment of knowledge
- Monte Carlo strategies in scientific computing
- Almost connected orders
