Evergreen
Ahmed Abdelmeged and Christine D. Hang and Daniel Rinehart and Karl J. Lieberherr. The Evergreen Game: The Promise of Polynomials to Boost Boolean MAX-CSP Solvers. Northeastern University, 2007, April, NU-CCIS-07-03. [info]
Ahmed Abdelmeged and Christine D. Hang and Daniel Rinehart and Karl J. Lieberherr. Superresolution and P-Optimality in Boolean MAX-CSP Solvers. Northeastern University, 2007, January, NU-CCIS-07-01. [info]
Technical Reports
Christine D. Hang, Ahmed Abdelmeged, Daniel Rinehart, and Karl J. Lieberherr. The Promise of Polynomial-based Local Search to Boost Boolean MAX-CSP Solvers. In Fourth International Workshop on Local Search Techniques in Constraint Satisfaction, CP2007, Providence, Rhode Island, September 2007. [pdf, slides(pdf)]
Workshop
