default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDArtificial Intelligence, Volume 81
Volume 81, Numbers 1-2, March 1996
- Tad Hogg, Bernardo A. Huberman, Colin P. Williams:
Phase Transitions and the Search Problem. 1-15 - Bart Selman, David G. Mitchell, Hector J. Levesque:
Generating Hard Satisfiability Problems. 17-29 - James M. Crawford, Larry D. Auton:
Experimental Results on the Crossover Point in Random 3-SAT. 31-57 - Ian P. Gent, Toby Walsh
:
The Satisfiability Constraint Gap. 59-80 - Patrick Prosser:
An Empirical Study of Phase Transitions in Binary Constraint Satisfaction Problems. 81-109 - David G. Mitchell, Hector J. Levesque:
Some Pitfalls for Experimenters with Random SAT. 111-125 - Tad Hogg:
Refining the Phase Transition in Combinatorial Search. 127-154 - Barbara M. Smith, Martin E. Dyer:
Locating the Phase Transition in Binary Constraint Satisfaction Problems. 155-181 - Jon W. Freeman:
Hard Random 3-SAT Problems and the Davis-Putnam Procedure. 183-198 - Robert Schrag, James M. Crawford:
Implicates and Prime Implicates in Random 3-SAT. 199-222 - Weixiong Zhang, Richard E. Korf:
A Study of Complexity Transitions on the Asymmetric Traveling Salesman Problem. 223-239 - Tom Bylander:
A Probabilistic Analysis of Propositional STRIPS Planning. 241-271 - Bart Selman, Scott Kirkpatrick:
Critical Behavior in the Computational Cost of Satisfiability Testing. 273-295 - Joseph C. Pemberton, Weixiong Zhang:
Epsilon-Transformation: Exploiting Phase Transitions to Solve Combinatorial Optimization Problems. 297-325 - Scott H. Clearwater, Tad Hogg:
Problem Structure Heuristics and Scaling Behavior for Genetic Algorithms. 327-347
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2024-09-30 00:05 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
