Portal-Based True-Distance Heuristics for Path Finding

First Page		Document Content
Date: 2011-03-10 14:26:22 Search algorithms Combinatorial optimization Heuristics Game artificial intelligence Routing algorithms Heuristic function A* search algorithm Heuristic Graph partition Mathematics Theoretical computer science Graph theory		Portal-Based True-Distance Heuristics for Path Finding Add to Reading List Source URL: webdocs.cs.ualberta.ca Download Document from Source Website File Size: 1,87 MB Share Document on Facebook

	arXiv:1807.01672v2 [cs.LG] 6 JulRanked Reward: Enabling Self-Play Reinforcement Learning for Combinatorial Optimization Alexandre Laterre DocID: 1xTSz - View Document
	APPROX 2012 and RANDOM 2012 15th Intl. Workshop on Approx. Algorithms for Combinatorial Optimization Problems - APPROX 2012 & 16th Intl. Workshop on Randomization and Computation - RANDOM 2012 http://cui.unige.ch/tcs/ran DocID: 1vegv - View Document
	⋆ Combinatorial Optimization (Oberwolfach, November 9–15, Discrete DC Programming by Discrete Convex Analysis —Use of Conjugacy— Kazuo Murota (U. Tokyo) DocID: 1uRbH - View Document
	Research Summary∗ Chandra Nair Overview In my early research career I considered random versions of combinatorial optimization problems; my doctoral thesis [17] resolved a long-standing conjecture about the assignment DocID: 1uvqi - View Document
	In silico optimization of a guava antimicrobial peptide enables combinatorial exploration for peptide design DocID: 1u55o - View Document