Author of the publication

A Bayesian Approach to Tackling Hard Computational Problems (Preliminary Report).

, , , , , and . Electron. Notes Discret. Math., (2001)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Critical Behavior in the Computational Cost of Satisfiability Testing., and . Artif. Intell., 81 (1-2): 273-295 (1996)Learning Sequences of Controllers for Complex Manipulation Tasks., , and . CoRR, (2013)Natural communities in large linked networks., , , and . KDD, page 541-546. ACM, (2003)A principled study of the design tradeoffs for autonomous trading agents., and . AAMAS, page 473-480. ACM, (2003)Planning as satisfiability, and . AAAI Conference on Artificial Intelligence, page 359--363. (1992)Generating Hard Satisfiability Problems., , and . Artif. Intell., 81 (1-2): 17-29 (1996)Heavy-Tailed Distributions in Combinatorial Search., , and . CP, volume 1330 of Lecture Notes in Computer Science, page 121-135. Springer, (1997)Formal Models of Heavy-Tailed Behavior in Combinatorial Search., , and . CP, volume 2239 of Lecture Notes in Computer Science, page 408-421. Springer, (2001)Relaxed DPLL Search for MaxSAT., , and . SAT, volume 5584 of Lecture Notes in Computer Science, page 447-452. Springer, (2009)Balance and Filtering in Structured Satisfiable Problems., , , , , and . IJCAI, page 351-358. Morgan Kaufmann, (2001)