Talks & Seminars
Title: Sampling Techniques for Constraint Satisfaction and Beyond
Mr. Kuldeep Singh Meel, Rice University
Date & Time: January 8, 2014 15:00
Venue: Lecture Hall, B Block, 02nd/03rd Floor, Department of Computer Science and Engineer, Kanwal Rekhi Building
Constraint problems have played a key role in diverse areas spanning testing, formal verification, planning, inferencing and the like. Apart from the classical problem of checking satisfiability, the problems of generating satisfying assignments randomly and of counting the total number of satisfying assignments have also attracted significant theoretical and practical interest over the years. Prior work offered heuristic approaches with no guarantee of solution distribution, and approaches with proven guarantees, but poor performance in practice. In this talk, I will describe a novel approach based on limited independent hashing and present two practical algorithms, UniWit and ApproxMC, for solving these two fundamental problems. Unlike prior work, our algorithms provide strong theoretical guarantees and also scale better to large problem sizes.
Speaker Profile:
Kuldeep Singh Meel graduated with a B.Tech. in Computer Science and Engineering from IIT Bombay in 2012. He is currently a PhD student in Rice University, working with Prof. Moshe Vardi (and Supratik Chakraborty at IIT Bombay). His research broadly falls in the intersection of program synthesis, computer-aided verification and formal methods. He is the recipient of the 2013 Andrew Ladd fellowship.
List of Talks


Faculty CSE IT
Forgot Password
    [+] Sitemap     Feedback