Understanding the role of noise in stochastic local search: analysis and experiments
DOI10.1016/j.artint.2007.09.010zbMath1183.68582OpenAlexW1981928934MaRDI QIDQ2389642
Publication date: 17 July 2009
Published in: Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.artint.2007.09.010
noiseBayesian networksconvexitypolynomial approximationrational functionsprobabilistic reasoningstochastic local searchMarkov chain modelsmost probable explanationexpected hitting timessystematic experimentsnoise response curves
Reasoning under uncertainty in the context of artificial intelligence (68T37) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Some nonlinear parameters of PP intervals of pulse main peaks
- Approximating MAPs for belief networks is NP-hard and other theorems
- Finding MAPs for belief networks is NP-hard
- Local search algorithms for SAT: an empirical evaluation
- Towards a characterisation of the behaviour of stochastic local search algorithms for SAT
- Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks
- Controlled generation of hard and easy Bayesian networks: Impact on maximal clique size in tree clustering
- The computational complexity of probabilistic inference using Bayesian belief networks
- On the hardness of approximate reasoning
- Error bounds for convolutional codes and an asymptotically optimum decoding algorithm
- A general scheme for automatic generation of search heuristics from specification \(dependencies^{*}\)
- Local search characteristics of incomplete SAT procedures
This page was built for publication: Understanding the role of noise in stochastic local search: analysis and experiments