- Neural network-based detection of mechanical, sensor and biological faults in deep-trough
- I N F O R M A T I K Planning CNFs with Small DPLL
- Knowledge Compilation and Theory Approximation BART SELMAN AND HENRY KAUTZ
- Annals of Mathematics and Artificial Intelligence 28 (2000) 3538 35 Perspectives
- The State of SAT Henry Kautz a
- Reasoning With Characteristic Models Henry A. Kautz, Michael J. Kearns, and Bart Selman
- Solving Problems with Hard and Soft Constraints Using a Stochastic Algorithm for MAX-SAT
- 1999 Macmillan Magazines Ltd rememberwithpleasureandsomesurprise
- Unifying SAT-based and Graph-based Planning Henry Kautz
- A Principled Study of the Design Tradeoffs for Autonomous Trading Agents
- Statistical Regimes Across Constrainedness Carla P. Gomes1
- Towards Efficient Sampling: Exploiting Random Walk Strategies Wei Wei, Jordan Erenrich, and Bart Selman
- Tracking evolving communities in large linked networks
- 1 COMPUTATIONAL COMPLEXITY iii S. KIRKPATRICK AND B. SELMAN iii
- Control Knowledge in Planning: Benefits and Tradeoffs Yi-Cheng Huang
- Evidence for Invariants in Local Search David McAllester, Bart Selman, and Henry Kautz
- An Experiment in the Design of Software Agents Henry A. Kautz, Bart Selman, Michael Coen,
- ELSEVIER Artificial Intelligence 81 ( 1996) 273-295 Intelligence
- Accelerating Random Walks Wei Wei and Bart Selman
- 2+ P-SAT: Relation of Typical-Case Complexity to the Nature of the Phase Remi Monasson1
- Regular random k-SAT: properties of balanced formulas Yacine Boufkhad1, Olivier Dubois2, Yannet Interian3, and Bart Selman4
- COMMUNICATION AND COMPUTATION IN DISTRIBUTED CSP ALGORITHMS
- A New Approach to Model Counting Wei Wei and Bart Selman
- 1999 Macmillan Magazines LtdNATURE |VOL 400 |8 JULY 1999 |www.nature.com 133 Determining computational
