Information Technology



KQNKRR

Classics

J. International Computer Chess Association, 15 (1): 16-18.




A training algorithm for optimum margin classifiers

Classics

Proceedings of the Fifth Annual Workshop on Computational Learning Theory 5: 144-152, 1992.


Hard and Easy SAT Problems

Classics

"We report results from large-scale experiments in satisfiability testing. As has been observed by others, testing the satisfiability of random formulas often appears surprisingly easy. Here we show that by using the right distribution of instances, and appropriate parameter values, it is possible to generate random formulas that are hard, that is, for which satisfiability testing is quite difficult. Our results provide a benchmark for the evaluation of satisfiability-testing procedures." Proc. AAAI-92.