From post

копировать удалить добавить публикацию в буфер
Запись сообщества
посмотреть историю данной записи
URL
DOI
BibTeX
EndNote
APA
Chicago
DIN 1505
Harvard
MSOffice XML

Low-density Parity Constraints for Hashing-Based Discrete Integration.

S. Ermon, C. Gomes, A. Sabharwal, и B. Selman. ICML, том 32 из JMLR Workshop and Conference Proceedings, стр. 271-279. JMLR.org, (2014)

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.

A principled study of the design tradeoffs for autonomous trading agents.I. Vetsikas, и B. Selman. AAMAS, стр. 473-480. ACM, (2003)Generating Hard Satisfiability Problems.B. Selman, D. Mitchell, и H. Levesque. Artif. Intell., 81 (1-2): 17-29 (1996)Natural communities in large linked networks.J. Hopcroft, O. Khan, B. Kulis, и B. Selman. KDD, стр. 541-546. ACM, (2003)Formal Models of Heavy-Tailed Behavior in Combinatorial Search.H. Chen, C. Gomes, и B. Selman. CP, том 2239 из Lecture Notes in Computer Science, стр. 408-421. Springer, (2001)Heavy-Tailed Distributions in Combinatorial Search.C. Gomes, B. Selman, и N. Crato. CP, том 1330 из Lecture Notes in Computer Science, стр. 121-135. Springer, (1997)Relaxed DPLL Search for MaxSAT.L. Kroc, A. Sabharwal, и B. Selman. SAT, том 5584 из Lecture Notes in Computer Science, стр. 447-452. Springer, (2009)Balance and Filtering in Structured Satisfiable Problems.H. Kautz, Y. Ruan, D. Achlioptas, C. Gomes, B. Selman, и M. Stickel. IJCAI, стр. 351-358. Morgan Kaufmann, (2001)Planning as satisfiabilityH. Kautz, и B. Selman. AAAI Conference on Artificial Intelligence, стр. 359--363. (1992)The Tractability of Path-Based Inheritance.B. Selman, и H. Levesque. Principles of Semantic Networks, Morgan Kaufmann, (1991)Hard Problems for Simple Default Logics.H. Kautz, и B. Selman. Artif. Intell., 49 (1-3): 243-279 (1991)