Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo

First Page		Document Content
Date: 2016-06-09 08:09:18 Game artificial intelligence Routing algorithms Computer programming Computing Mathematics Automated planning and scheduling Theoretical computer science Macro Satisficing A* search algorithm Planning Domain Definition Language Heuristic		Exploiting Search Space Structure in Classical Planning: Analyses and Algorithms (Dissertation Abstract) Masataro Asai Graduate School of Arts and Sciences University of Tokyo Add to Reading List Source URL: icaps16.icaps-conference.org Download Document from Source Website File Size: 215,04 KB Share Document on Facebook

	Learning To Cooperate in a Social Dilemma: A Satisficing Approach to Bargaining Jeffrey L. Stimpson & Michael A. Goodrich Computer Science Department, Brigham Young University, Provo, UT 84602 DocID: 1uYZt - View Document
	Learning ε-Pareto Efficient Solutions With Minimal Knowledge Requirements Using Satisficing Jacob W. Crandall and Michael A. Goodrich Computer Science Department Brigham Young University Provo, UT 84602 DocID: 1uzv4 - View Document
	Cambridge Journal DocID: 1r5b0 - View Document
	Microsoft Word - practical-action-cor-working-paper.doc DocID: 1qFU1 - View Document