| Year |
Citation |
Score |
| 2013 |
Ermon S, Xue Y, Gomes C, Selman B. Learning policies for battery usage optimization in electric vehicles Machine Learning. 92: 177-194. DOI: 10.1007/S10994-013-5378-Z |
0.323 |
|
| 2011 |
Previti A, Ramanujan R, Schaerf M, Selman B. Monte-Carlo style UCT search for boolean satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6934: 177-188. DOI: 10.1007/978-3-642-23954-0_18 |
0.513 |
|
| 2011 |
Previti A, Ramanujan R, Schaerf M, Selman B. Applying UCT to Boolean satisfiability Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6695: 373-374. DOI: 10.1007/978-3-642-21581-0_35 |
0.516 |
|
| 2011 |
Ramanujan R, Selman B. Trade-offs in sampling-based adversarial planning Icaps 2011 - Proceedings of the 21st International Conference On Automated Planning and Scheduling. 202-209. |
0.521 |
|
| 2010 |
Battiti R, Selman B, Stützle T. Special issue on learning and intelligent optimization Annals of Mathematics and Artificial Intelligence. 60: 1-2. DOI: 10.1007/S10472-011-9232-3 |
0.328 |
|
| 2010 |
Kroc L, Sabharwal A, Selman B. An empirical study of optimal noise and runtime distributions in local search Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 6175: 346-351. DOI: 10.1007/978-3-642-14186-7_31 |
0.69 |
|
| 2010 |
Ramanujan R, Sabharwal A, Selman B. On adversarial search spaces and sampling-based planning Icaps 2010 - Proceedings of the 20th International Conference On Automated Planning and Scheduling. 242-245. |
0.472 |
|
| 2010 |
Ramanujan R, Sabharwal A, Selman B. Understanding sampling style adversarial search methods Proceedings of the 26th Conference On Uncertainty in Artificial Intelligence, Uai 2010. 474-483. |
0.522 |
|
| 2010 |
Kroc L, Sabharwal A, Selman B. Approximate inference for clusters in solution spaces Aaai Workshop - Technical Report. 38-41. |
0.673 |
|
| 2009 |
Kroc L, Sabharwal A, Selman B. Message-passing and local heuristics as decimation strategies for satisfiability Proceedings of the Acm Symposium On Applied Computing. 1408-1414. DOI: 10.1145/1529282.1529596 |
0.711 |
|
| 2009 |
Kroc L, Sabharwal A, Selman B. Relaxed DPLL search for MaxSAT Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5584: 447-452. DOI: 10.1007/978-3-642-02777-2_41 |
0.678 |
|
| 2009 |
Kroc L, Sabharwal A, Gomes CP, Selman B. Integrating systematic and local search paradigms: A new strategy for MaxSAT Ijcai International Joint Conference On Artificial Intelligence. 544-551. |
0.712 |
|
| 2009 |
Kroc L, Sabharwal A, Selman B. Counting solution clusters in graph coloring problems using Belief Propagation Advances in Neural Information Processing Systems 21 - Proceedings of the 2008 Conference. 873-880. |
0.697 |
|
| 2008 |
Kroc L, Sabharwal A, Selman B. Leveraging belief propagation, backtrack search, and statistics for model counting Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 5015: 127-141. DOI: 10.1007/S10479-009-0680-7 |
0.722 |
|
| 2007 |
Hoffmann J, Gomes C, Selman B. Structure and Problem Hardness: Goal Asymmetry and DPLL Proofs in SAT-Based Planning Logical Methods in Computer Science. 3. DOI: 10.2168/Lmcs-3(1:6)2007 |
0.322 |
|
| 2007 |
Vetsikas IA, Selman B. Bayes-Nash equilibria for m th price auctions with multiple closing times Sigecom Exchanges. 6: 27-36. DOI: 10.1145/1228621.1228624 |
0.719 |
|
| 2007 |
Vetsikas IA, Jennings NR, Selman B. Generating Bayes-Nash equilibria to design autonomous trading agents Ijcai International Joint Conference On Artificial Intelligence. 1543-1550. |
0.722 |
|
| 2007 |
Kroc L, Sabharwal A, Selman B. Survey propagation revisited Proceedings of the 23rd Conference On Uncertainty in Artificial Intelligence, Uai 2007. 217-226. |
0.7 |
|
| 2005 |
Gomes CP, Selman B. Computational science: can get satisfaction. Nature. 435: 751-2. PMID 15944688 DOI: 10.1038/435751A |
0.335 |
|
| 2005 |
Vetsikas IA, Selman B. Autonomous trading agent design in the presence of tradeoffs Acm International Conference Proceeding Series. 113: 293-299. DOI: 10.1145/1089551.1089607 |
0.693 |
|
| 2005 |
Béjar R, Domshlak C, Fernández C, Gomes C, Krishnamachari B, Selman B, Valls M. Sensor networks and distributed CSP: Communication, computation and complexity Artificial Intelligence. 161: 117-147. DOI: 10.1016/J.Artint.2004.09.002 |
0.321 |
|
| 2005 |
Boufkhad Y, Dubois O, Interian Y, Selman B. Regular random k-SAT: Properties of balanced formulas Journal of Automated Reasoning. 35: 181-200. DOI: 10.1007/S10817-005-9012-Z |
0.325 |
|
| 2005 |
Ansotegui C, Gomes CP, Selman B. The achilles' heel of QBF Proceedings of the National Conference On Artificial Intelligence. 1: 275-281. |
0.304 |
|
| 2004 |
Vetsikas IA, Selman B. A methodology and equilibria for design tradeoffs of autonomous trading agents Proceedings of the Third International Joint Conference On Autonomous Agents and Multiagent Systems, Aamas 2004. 3: 1286-1287. |
0.737 |
|
| 2003 |
Vetsikas IA, Selman B. A Principled Study of the Design Tradeoffs for Autonomous Trading Agents Proceedings of the Interantional Conference On Autonomous Agents. 2: 473-480. |
0.728 |
|
| 2002 |
Gomes CP, Selman B. Computer science. Satisfied with physics. Science (New York, N.Y.). 297: 784-5. PMID 12161641 DOI: 10.1126/Science.1074599 |
0.366 |
|
| 2001 |
Horvitz E, Ruan Y, Gomes C, Kautz H, Selman B, Chickering M. A Bayesian approach to tackling hard computational problems (preliminary report) Electronic Notes in Discrete Mathematics. 9: 376-391. DOI: 10.1016/S1571-0653(04)00335-X |
0.374 |
|
| 2001 |
Kautz H, Selman B. Preface. Volume 9 Electronic Notes in Discrete Mathematics. 9: 1. DOI: 10.1016/S1571-0653(04)00309-9 |
0.329 |
|
| 2001 |
Gomes CP, Selman B. Algorithm portfolios Artificial Intelligence. 126: 43-62. DOI: 10.1016/S0004-3702(00)00081-3 |
0.391 |
|
| 2000 |
GOMES C, SELMAN B. HYBRID SEARCH STRATEGIES FOR HETEROGENEOUS SEARCH SPACES International Journal On Artificial Intelligence Tools. 9: 45-57. DOI: 10.1142/S0218213000000057 |
0.391 |
|
| 2000 |
Selman B. Compute-intensive methods in artificial intelligence Annals of Mathematics and Artificial Intelligence. 28: 35-38. DOI: 10.1023/A:1018943920174 |
0.325 |
|
| 2000 |
Gomes CP, Selman B, Crato N, Kautz H. Heavy-tailed phenomena in satisfiability and constraint satisfaction problems Journal of Automated Reasoning. 24: 67-100. DOI: 10.1023/A:1006314320276 |
0.335 |
|
| 1999 |
Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L. Determining computational complexity from characteristic 'phase transitions' Nature. 400: 133-137. DOI: 10.1038/22055 |
0.365 |
|
| 1999 |
Monasson R, Zecchina R, Kirkpatrick S, Selman B, Troyansky L. 2 + p-SAT: Relation of typical-case complexity to the nature of the phase transition Random Structures and Algorithms. 15: 414-435. DOI: 10.1002/(Sici)1098-2418(199910/12)15:3/4<414::Aid-Rsa10>3.0.Co;2-G |
0.309 |
|
| 1996 |
Selman B, Kautz H. Knowledge compilation and theory approximation Journal of the Acm. 43: 193-224. DOI: 10.1145/226643.226644 |
0.306 |
|
| 1996 |
Selman B, Levesque HJ. Support set selection for abductive and default reasoning Artificial Intelligence. 82: 259-272. DOI: 10.1016/0004-3702(94)00069-7 |
0.34 |
|
| 1994 |
Kirkpatrick S, Selman B. Critical behavior in the satisfiability of random Boolean expressions Science. 264: 1297-1301. DOI: 10.1126/Science.264.5163.1297 |
0.302 |
|
| 1993 |
Selman B, Levesque HJ. The complexity of path-based defeasible inheritance Artificial Intelligence. 62: 303-339. DOI: 10.1016/0004-3702(93)90081-L |
0.336 |
|
| 1991 |
Kautz HA, Selman B. Hard problems for simple default logics Artificial Intelligence. 49: 243-279. DOI: 10.1016/0004-3702(91)90011-8 |
0.308 |
|
| Show low-probability matches. |