Meinolf Sellmann

Meinolf Sellmann
Fields Algorithms, Operations Research and Artificial Intelligence for Combinatorial optimization
Institutions IBM Research
Alma mater Paderborn University
Doctoral advisor Burkhard Monien
Doctoral students Serdar Kadioglu, Yuri Malitsky
Notable awards Doctoral Thesis Award 2004, NSF Career Award 2007, SAT Competition Gold Medalist 2011, Winning Application Solver in the 2012 SAT Challenge, SAT Competition Gold Medalist 2013, seventeen winning solvers at the 2013-2016 MaxSAT Evaluations, IBM Outstanding Technical Innovation Awards 2013 and 2014 and an IBM A-Level Business Accomplishment 2015.

Meinolf Sellmann, born in Holzminden, Germany, computer scientist, best known for algorithmic research, with a special focus on self-improving algorithms, automatic algorithm configuration and algorithm portfolios based on artificial intelligence, combinatorial optimization, and the hybridization thereof.

He received a doctorate degree (Dr. rer. nat.) in 2002 from Paderborn University (Germany) and is now senior manager for data curation in the cognitive computing department at IBM Research. Prior to 2010 he was appointed Assistant Professor at Brown University and Postdoctoral Scholar at Cornell University. His honors include the Prize of the Faculty of the University of Paderborn (Germany) for his doctoral thesis, an NSF Career Award in 2007, two Gold Medals at the SAT Competition 2011, a winning Solver at the 2012 SAT Challenge, two Gold Medals at the SAT Competition 2013, and seventeen winning solvers at the 2013-2016 MaxSAT Evaluations. He also received IBM Outstanding Technical Innovation Awards in 2013 and 2014, and an A-level Business Accomplishment 2015. He was invited Keynote Speaker at AAAI 2015 and served as Conference Chair of CP 2007, conference-wide Workshop Chair of AAAI 2008, and as Program Chair of CPAIOR 2013 and LION 2016.

References

This article is issued from Wikipedia - version of the 10/27/2016. The text is available under the Creative Commons Attribution/Share Alike but additional terms may apply for the media files.