Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel

First Page		Document Content
Date: 2014-08-11 10:56:40 Heuristics Linux games Windows games Sokoban Heuristic function Heuristic Admissible heuristic Mathematical optimization Planning Domain Definition Language Digital media Application software Software		Generating and Evaluating Unsolvable STRIPS Planning Instances for Classical Planning Bachelor’s Thesis Natural Science Faculty of the University of Basel Add to Reading List Source URL: ai.cs.unibas.ch Download Document from Source Website File Size: 1,55 MB Share Document on Facebook

	Softstar: Heuristic-Guided Probabilistic Inference Mathew Monfort Computer Science Department University of Illinois at Chicago Chicago, IL 60607 DocID: 1xTJu - View Document
	Problem Difficulty and the Phase Transition in Heuristic Search Eldan Cohen and J. Christopher Beck Department of Mechanical & Industrial Engineering University of Toronto Toronto, Canada {ecohen, jcb}@mie.utoronto.ca DocID: 1vf9m - View Document
	AUTO2, a saturation-based heuristic prover for higher-order logic Bohua Zhan Massachusetts Institute of Technology DocID: 1uLt2 - View Document
	A Heuristic-Based Approach for Planning Federated SPARQL Queries Gabriela Montoya1 , Maria-Esther Vidal1 , and Maribel Acosta1,2 1 2 DocID: 1uGfs - View Document
	An Effective Implementation of the Lin-Kernighan Traveling Salesman Heuristic Keld Helsgaun E-mail: Department of Computer Science Roskilde University DocID: 1uC4Z - View Document