Bart Selman

From Wikipedia, the free encyclopedia
Jump to: navigation, search

Bart Selman is an American professor of computer science at Cornell University. He used to be at AT&T Bell Laboratories. He has authored over 90 publications, which have appeared in Nature, Science, Proceedings of the National Academy of Sciences, and a variety of conferences and journals in artificial intelligence 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, a National Science Foundation Career Award, and an Alfred P. Sloan Research Fellowship. He is a Fellow of the American Association for Artificial Intelligence and a Fellow of the American Association for the Advancement of Science. He sits on the advisory board for the DARPA Grand Challenge Cornell Team.

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

Selman teaches courses on artificial intelligence at Cornell University and advises postdoctoral fellows.

Partial list of Selman's papers[edit]

  • Statistical Regimes Across Constrainedness Regions, Carla P. Gomes, Cesar Fernandez, Bart Selman, and Christian 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.

References[edit]

External links[edit]