The following pages link to Bart Selman (Q545552):
Displaying 48 items.
- (Q197135) (redirect page) (← links)
- Leveraging belief propagation, backtrack search, and statistics for model counting (Q545553) (← links)
- The complexity of path-based defeasible inheritance (Q685542) (← links)
- Statistical regimes across constrainedness regions (Q850446) (← links)
- Regular random \(k\)-SAT: Properties of balanced formulas (Q862410) (← links)
- A special-purpose processor for the Monte Carlo simulation of Ising spin systems (Q1050073) (← links)
- Hard problems for simple default logics (Q1182166) (← links)
- Compute-intensive methods in artificial intelligence (Q1601839) (← links)
- Horn approximations of empirical data (Q1855210) (← links)
- Heavy-tailed phenomena in satisfiability and constraint satisfaction problems (Q1977752) (← links)
- Hidden community detection on two-layer stochastic models: a theoretical perspective (Q2110736) (← links)
- Sensor networks and distributed CSP: communication, computation and complexity (Q2457701) (← links)
- Model-preference default theories (Q2638818) (← links)
- The state of SAT (Q2643296) (← links)
- Generating hard satisfiability problems (Q2674174) (← links)
- Critical behavior in the computational cost of satisfiability testing (Q2674189) (← links)
- Support set selection for abductive and default reasoning (Q2674205) (← links)
- (Q2734936) (← links)
- (Q2741510) (← links)
- (Q2741540) (← links)
- (Q2749853) (← links)
- Critical Behavior in the Satisfiability of Random Boolean Expressions (Q3101335) (← links)
- (Q3200595) (← links)
- DPLL: The Core of Modern Satisfiability Solvers (Q3305326) (← links)
- (Q3493327) (← links)
- Short XORs for Model Counting: From Theory to Practice (Q3612459) (← links)
- (Q3830558) (← links)
- Knowledge compilation and theory approximation (Q4371669) (← links)
- (Q4375773) (← links)
- (Q4460805) (← links)
- (Q4473032) (← links)
- (Q4475647) (← links)
- (Q4704799) (← links)
- An Empirical Study of Optimal Noise and Runtime Distributions in Local Search (Q4930603) (← links)
- On the Erdős Discrepancy Problem (Q5265097) (← links)
- Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning (Q5310682) (← links)
- Solutions for Hard and Soft Constraints Using Optimized Probabilistic Satisfiability (Q5326467) (← links)
- Determining computational complexity from characteristic ‘phase transitions’ (Q5354392) (← links)
- Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting (Q5387627) (← links)
- (Q5687271) (← links)
- Theory and Applications of Satisfiability Testing (Q5713722) (← links)
- Theory and Applications of Satisfiability Testing (Q5714751) (← links)
- (Q5740444) (← links)
- QBF Modeling: Exploiting Player Symmetry for Simplicity and Efficiency (Q5756570) (← links)
- Principles and Practice of Constraint Programming – CP 2003 (Q5897190) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900281) (← links)
- Principles and Practice of Constraint Programming – CP 2004 (Q5900283) (← links)
- Algorithm portfolios (Q5940819) (← links)
