Meinolf Sellmann image

Meinolf Sellmann

PhD, Computer Science (University of Paderborn)

Meinolf Sellmann, American-German 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 Technology Manager for machine learning and knowledge discovery at the research center of General Electric

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 was invited Keynote Speaker at Anziam 2017, Techkriti 2017, Optimization Days 2017, OR 2017, AAAI 2015 and serves/ed on the IEEE technical board for emerging technologies (2012-2015), the AAAI education board (since 2016), as Cluster Chair on the Future of Computing at Informs in 2017 and 2018, Conference Chair of CP 2007, conference-wide Workshop Chair of AAAI 2008, and as Program Chair of CPAIOR 2013 and LION 2016.

"AI is for the 21st century what electricity was for the 20th."

Just for fun
Just for fun

I invite you to play dice with me - whoever throws the higher number wins. We have four dice that do not look like regular dice, because they can have multiple copies of the same numbers. The dice look like this:

Die A: 0, 0, 4, 4, 4, 4

Die B: 3, 3, 3, 3, 3, 3

Die C: 2, 2, 2, 2, 6, 6

Die D: 1, 1, 1, 5, 5, 5

Before we throw our dice simultaneously, we each select the die we want to play with. One player chooses one of the four dice, the second player chooses one of the three remaining dice. Would you like to go first or second? And what are our respective chances of winning?

We're ready to partner with you. 

Contact Us