Wed Feb 15 Modern SAT solvers & Distributed redundant queueing with Apache Kafka

Hello all,

We will host this Meetup at The Atomic Co-Working space.

Please note that the Meetup this time will be on Wednesday February 15th instead of Tuesday February 14th. In this Meetup we will have again two awesome speakers . As the first speaker we will have Ifaz Kabir who will teach us about modern SAT solvers. As the second speaker we will have Christopher Vollick from Shopify who will teach us more about Apache Kafka.

Modern SAT solvers by Ifaz Kabir

Can we write an efficient algorithm which tells us whether there's a satisfying assignment to a given boolean formula? Complexity theory would immediately dismiss the idea and point us towards a proof of NP Completeness of SAT. Yet we have SAT solvers that solve industrially generated instances within a reasonable amount of time. This talk will explore how a certain class of these solvers work, what they are used for, and known problems that these solvers cannot solve.

Bio

Ifaz is a graduate student in the Programming Languages Group at the University of Waterloo. His current research involves extensions to the DOT calculus for Scala. He is a lover of all things camels, including OCaml!

Distributed redundant queueing involving Apache Kakfa by Christopher Vollick