Bart Selman

From Wikipedia, the free encyclopedia

Bart Selman
Bart Selman

Bart Selman is an associate professor of computer science at Cornell University. He previously was at AT&T Bell Laboratories. He has (co-)authored over 90 publications, which have appeared in venues spanning Nature, Science, Proceedings of the National Academy of Sciences and a variety of conferences and journals in AI and Computer Science. He has received five Best Paper Awards. He has also received the Cornell Stephen Miles Excellence in Teaching Award, the Cornell Outstanding Educator Award, an NSF Career Award, and an Alfred P. Sloan Research Fellowship. Currently, he is a Fellow of the American Association for Artificial Intelligence and a Fellow of the American Association for the Advancement of Science. Dr. Selman is also famous for his version of stamppot, a traditional Dutch dish made of mashed potatoes, cabbage, and rookworst.

His research interests include tractable inference, knowledge representation, stochastic search methods, theory approximation, knowledge compilation, planning, default reasoning, and connections between computer science and statistical physics (phase transition phenomena).

Professor Selman is currently teaching COM S 472: Foundations of Artificial Intelligence at Cornell University.


  • Statistical Regimes Across Constrainedness Regions, Carla P. Gomes, Cesar Fernandez, Bart Selman, and Chistian Bessiere. Proc. 10th Intl. Conf. on Principles and Practice of Constraint Programming (CP-04), Toronto, Ont., 2004. Distinguished Paper Award.
  • Towards Efficient Sampling: Exploiting Random Walk Strategies, Wei Wei, Jordan Erenrich, and Bart Selman. Proc. AAAI-04. San Jose, CA, 2004.
  • Tracking evolving communities in large linked networks, John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman. Proc. Natl. Acad. of Sci. (PNAS), Febr., 2004.
  • Natural communities in large linked networks, John Hopcroft, Brian Kulis, Omar Khan, and Bart Selman. Proc. KDD, August, 2003.
  • Backdoors To Typical Case Complexity, Ryan Williams, Carla Gomes, and Bart Selman. Proc. IJCAI-03 Acapulco, Mexico, 2003.
  • Communication and computation in distributed CSP algorithms, Cesar Fernandez, Ramon Bejar, Bhaskar Krishnamachari, Carla Gomes, and Bart Selman. In Distributed Sensor Networks, A Multiagent Perspective. V. Lesser, C.L. Ortiz, Jr., and M. Tambe (Eds.) Kluwer Academic Publishers, 2003.
  • A principled study of the design tradeoffs for autonomous trading agents, Ioannis A. Vetsikas and Bart Selman. Second International Joint Conference on Autonomous Agents and Multi-Agent Systems, Melbourne, 2003. Describes Whitebear trading agent, winner of the Trading Agent competition 2002 (TAC-02).
  • Satisfied with Physics, Gomes, Carla and Selman, Bart. Science, Vol. 297, Aug. 2, 2002, 784--785. (Perspectives article.) Accompanying Mezard, Parisi, and Zecchina.
  • Accelerating Random Walks, Wei, Wei and Selman, Bart. Proceedings of 8th Intl. Conference on the Principles and Practice of Constraint Programming (CP-2002), 2002.
  • Dynamic Restart Policies, Kautz, Henry, Horvitz, Eric, Ruan, Yongshao, Gomes, Carla, and Selman, Bart. Proceedings of the Eighteenth National Conference on Artificial Intelligence (AAAI-02) Edmonton, Alberta, Canada, 2002, 674--682.
Advanced Search
Included Web Search Engines


Safe Search

close

Top Matching Results

Occasionally Search.com will highlight specialized results that are based on the context of your query. Examples of specialized results include specific links to news, images, or video.

Top Matching Results may highlight information from other Search.com pages, content from the CNET Network of sites, or third party content. The listings are based purely on relevance. Search.com does not receive payment for listings in this section but our partners that provide this data may get paid for listing these products.

Sponsored Links

This section contains paid listings which have been purchased by companies that want to have their sites appear for specific search terms and related content. These listings are administered, sorted and maintained by a third party and are not endorsed by Search.com.

Search Results

Search.com sends your search query to several search engines at one time and integrates the results into one list which has been sorted by relevance using Search.com's proprietary algorithm. You can customize the list of search engines included in your metasearch from the preferences.

The search engines that are used in your metasearch may allow companies to pay to have their Web sites included within the results. To view the Paid Inclusion policy for a specific search engine, please visit their Web site. Search.com does not accept payment or share revenue with any search engine partner for listings in this section.