Graph learning with a nearest neighbor approach

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Graph learning with a nearest neighbor approach

Full text

Pdf (1.01 MB)

Source

Annual Workshop on Computational Learning Theory archive
Proceedings of the ninth annual conference on Computational learning theory table of contents

Desenzano del Garda, Italy

Pages: 19 - 28

Year of Publication: 1996

ISBN:0-89791-811-8

Authors

Sven Koenig	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA
Yury Smirnov	School of Computer Science, Carnegie Mellon University, Pittsburgh, PA

Sponsors

Univ degli Studi de Milano : Universite degli Studi de Milano
SIGACT: ACM Special Interest Group on Algorithms and Computation Theory
SIGART: ACM Special Interest Group on Artificial Intelligence

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 19, Downloads (12 Months): 40, Citation Count: 2

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/238061.238065 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Gregory D. Benson , Armand Prieditis, Learning continuous-space navigation heuristics in real time, Proceedings of the second international conference on From animals to animats 2 : simulation of adaptive behavior: simulation of adaptive behavior, p.514, August 1993, Honolulu, Hawai, United States
	2	Margrit Betke , Ronald L. Rivest , Mona Singh, Piecemeal Learning of an Unknown Environment, Machine Learning, v.18 n.2-3, p.231-254, Feb./March 1995 [doi>10.1007/BF00993411]
	3	Avrim Blum , Prasad Chalasani , Don Coppersmith , Bill Pulleyblank , Prabhakar Raghavan , Madhu Sudan, The minimum latency problem, Proceedings of the twenty-sixth annual ACM symposium on Theory of computing, p.163-171, May 23-25, 1994, Montreal, Quebec, Canada [doi>10.1145/195058.195125]
	4	X. Deng and C.H. Papadimitriou. Exploring an unknown graph. In Proceedings of the Symposium on Foundations of Computer Science, pages 355-361, 1990.
	5	C. Hierholzer. f)ber die M6glichkeit, einen Linienzug ohne Wiederholung und ohne Unterbrechung zu umfahren. Mathematische Annalen, 6:30-32, 1873 (sic !).
	6	E. Korach , S. Kutten , S. Moran, A modular technique for the design of efficient distributed leader finding algorithms, ACM Transactions on Programming Languages and Systems (TOPLAS), v.12 n.1, p.84-101, Jan. 1990 [doi>10.1145/77606.77610]
	7	Richard E. Korf, Real-time heuristic search, Artificial Intelligence, v.42 n.2-3, p.189-211, March 1990 [doi>10.1016/0004-3702(90)90054-4]
	8	Andrew W. Moore , Christopher G. Atkeson, Prioritized Sweeping: Reinforcement Learning with Less Data and Less Time, Machine Learning, v.13 n.1, p.103-130, Oct. 1993 [doi>10.1023/A:1022635613229]
	9	Joseph C. Pemberton , Richard E. Korf, Incremental path planning on graphs with cycles, Proceedings of the first international conference on Artificial intelligence planning systems, p.179-188, May 1992, College Park, Maryland, United States
	10	D.J. Rosenkrantz, R.E. Steams, andP. M. LewisII. Ananalysis of several heuristics for the traveling salesman problem. SIAM Journal of Computing, 6(3):563-581, 1977.
	11	Y. Smimov, S. Koenig, M. Veloso, and R. Simmons. Efficient goal-directed exploration. In Proceedings of the National Conference on AI, page to appear, 1996.
	12	A. Stentz. The focussedD* algorithmforreal-timereplanning. In Proceedings of the IJCAL pages 1652-1659, 1995.

CITED BY 2

	Sven Koenig , Craig Tovey , Yuri Smirnov, Performance bounds for planning in unknown terrain, Artificial Intelligence, v.147 n.1-2, p.253-279, July 2003
	Israel A. Wagner , Michael Lindenbaum , Alfred M. Bruckstein, Efficiently searching a graph by a smell-oriented vertex process, Annals of Mathematics and Artificial Intelligence, v.24 n.1-4, p.211-223, 1998