First Page | Document Content | |
---|---|---|
Date: 2008-06-30 05:38:49Constraint programming NP-complete problems Puzzles Crossword Constraint satisfaction Local consistency Human behavior Backtracking Theoretical computer science Cognition | Crossword Puzzles as a Constraint Problem Anbulagan and Adi Botea NICTA?? and Australian National University, Canberra, Australia {anbulagan|adi.botea}@nicta.com.au Abstract. We present new results in crossword compositAdd to Reading ListSource URL: abotea.rsise.anu.edu.auDownload Document from Source WebsiteFile Size: 99,33 KBShare Document on Facebook |
Protocol log analysis with constraint programming Mats Carlsson Olga Grinchtein Justin PearsonDocID: 1xUdh - View Document | |
PDF DocumentDocID: 1xSrV - View Document | |
Answer Sets: From Constraint Programming Towards Qualitative Optimization Gerhard BrewkaDocID: 1vleR - View Document | |
Constraint Programming Mark Wallace Contact address: Mark Wallace, IC-Parc, William Penney Laboratory, Imperial College, LONDON SW7 2AZ. email: September 1995DocID: 1v7SC - View Document | |
Solving Segment Routing Problems with Hybrid Constraint Programming Techniques Renaud Hartert, Pierre Schaus, Stefano Vissicchio, and Olivier Bonaventure UCLouvain, ICTEAM, Place Sainte Barbe 2, 1348 Louvain-la-Neuve, BeDocID: 1v72L - View Document |