scientific article

zbMath0991.68564MaRDI QIDQ2741540

Mark E. Stickel, Yongshao Ruan, E. Horvitz, Max Chickering, Bart Selman, Carla P. Gomes, Henry A. Kautz

Publication date: 24 September 2001

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Mathematics Subject Classification ID

Fundamental topics (basic mathematics, methodology; applicable to economics in general) (91B02) Knowledge representation (68T30)

Related Items (8)

Statistical regimes across constrainedness regions ⋮ The state of SAT ⋮ Understanding the role of noise in stochastic local search: analysis and experiments ⋮ Learning dynamic algorithm portfolios ⋮ Portfolios in stochastic local search: efficiently computing most probable explanations in Bayesian networks ⋮ A machine learning approach to algorithm selection for \(\mathcal{NP}\)-hard optimization problems: a case study on the MPE problem ⋮ Measuring instance difficulty for combinatorial optimization problems ⋮ A PAC Approach to Application-Specific Algorithm Selection

Uses Software

• Walksat

Cites Work

• Unnamed Item
• Unnamed Item
• Optimal speedup of Las Vegas algorithms
• The complexity of completing partial Latin squares
• A Bayesian method for the induction of probabilistic networks from data
• Bayesian analysis in expert systems. With comments and a rejoinder by the authors
• Heavy-tailed phenomena in satisfiability and constraint satisfaction problems
• The state of SAT
• 10.1162/153244301753344614
• Learning to reason
• A machine program for theorem-proving

This page was built for publication: