Changes

Jump to: navigation, search

Best-First

216 bytes added, 15:08, 22 November 2018
no edit summary
* [[Alexander Reinefeld]], [[Tony Marsland]], [[Jonathan Schaeffer]] ('''1985'''). ''Is Best First Search Really Best?'' Technical Report TR 85-16, Department of Computer Science, [[University of Alberta]].
* [[Hermann Kaindl]], [[Helmut Horacek]], [[Marcus Wagner]] ('''1986'''). ''Selective Search versus Brute Force.'' [[ICGA Journal#9_3|ICCA Journal, Vol. 9, No. 3]]
* [[Richard Karp]], [[Yanjun Zhang]] ('''1988'''). ''[https://dl.acm.org/citation.cfm?id=62212.62240 A randomized parallel branch-and-bound procedure]''. [https://dblp.uni-trier.de/db/conf/stoc/stoc88.html STOC '88]
* [[Anup K. Sen]], [[Amitava Bagchi]] ('''1989'''). ''Fast Recursive Formulations for Best-First Search that allow Controlled use of Memory''. [[Conferences#IJCAI|IJCAI 1989]], [http://www.ijcai.org/Past%20Proceedings/IJCAI-89-VOL1/PDF/047.pdf pdf]
==1990 ...==

Navigation menu