Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Parkes, Andrew J. - Computational Intelligence Research Laboratory, University of Oregon
Easy Predictions for the Easy-Hard-Easy Transition Andrew J. Parkes
Supermodels and Robustness Matthew L. Ginsberg
Exploiting Solution Clusters for CoarseGrained Distributed Andrew J. Parkes
Clustering at the Phase Transition Andrew J. Parkes
Distributed Local Search, Phase Transitions and Polylog Time Andrew J. Parkes
Easy Predictions for the EasyHardEasy Transition Andrew J. Parkes
Likely Nearterm Advances in SAT Solvers 1 Heidi E. Dixon
Satisfiability Algorithms and Finite Quantification Matthew L. Ginsberg
Satisfiability Algorithms and Finite Quantification Matthew L. Ginsberg
Copyright 1996, American Association for Artificial Intelligence. All rights reserved. 1 Tuning Local Search for Satisfiability Testing \Lambda
Exploiting Solution Clusters for Coarse-Grained Distributed Andrew J. Parkes
Universally Quantified Constraints for Planning Andrew J. Parkes
Lifted Search Engines for Satisfiability Andrew J. Parkes
Supermodels and Robustness Matthew L. Ginsberg
Distributed Local Search, Phase Transitions and Polylog Time Andrew J. Parkes
LIFTED SEARCH ENGINES FOR SATISFIABILITY ANDREW JOHN PARKES
Lifted Search Engines for Satisfiability Andrew J. Parkes
Likely Near-term Advances in SAT Solvers1 Heidi E. Dixon
