First Page | Document Content | |
---|---|---|
Date: 2016-07-08 17:59:42Theoretical computer science Robot kinematics Constraint programming NP-complete problems Motion planning Pursuit-evasion Satisfiability modulo theories Automated planning and scheduling Liveness | International Conference on Automated Planning and Scheduling (ICAPSTask and Motion Policy Synthesis as Liveness Games Yue Wang and Neil T. Dantam and Swarat Chaudhuri and Lydia E. Kavraki Department of ComputerAdd to Reading ListSource URL: www.neil.dantam.nameDownload Document from Source WebsiteFile Size: 1,16 MBShare 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 |