Many problems require searching through an exponentially large space of possibilities to find a feasible or optimal solution. Sometimes these problems allow efficient algorithms, whereas in other cases sophisticated techniques from areas such as search, integer programming, and branch decomposition can still be quite effective in practice. Researchers at Duke have used these techniques for solving large games, allocating resources efficiently, ranking alternatives, dead-end elimination, constraint satisfaction in protein structure determination, predicting antimicrobial resistance, and design of therapeutic proteins that are currently in clinical trials.
- James B. Duke Distinguished Professor of Computer Science
- Gilbert, Louis, and Edward Lehrman Distinguished ProfessorProfessor of Electrical and Computer Engineering, Professor of Statistical Science, Professor of Biostatistics and Bioinformatics (Joint)
- Eugene Anson Stead, Jr. M.D. Associate ProfessorAssociate Professor of Biostatistics & Bioinformatics and Associate Professor of Computer Science
