-
Prof. Bart Selman (Cornell University)23/05/2012, 17:00In recent years, we have seen tremendous progress in inference technologies. For example, in the area of Boolean satisfiability (SAT) and Mixed Integer Programming (MIP) solvers now enable us to tackle significant practical problem instances from applications in hardware and software verification, planning, and scheduling. Key to this success is the ability to strike the right...Go to contribution page
-
Prof. Zoltan Toroczkai (University of Notre Dame)23/05/2012, 18:00Boolean satisfiability (k-SAT) is one of the most studied optimization problems, as an efficient (polynomial-time) solution to k-SAT (for k > 2) implies efficient solutions to a very large number of hard optimization problems. Here we propose a mapping of k-SAT into a deterministic continuous-time dynamical system with a unique correspondence between its attractors and the k-SAT...Go to contribution page
Choose timezone
Your profile timezone: