Multiple-goal heuristic search

Journal of Artificial Intelligence Research

Volumn 26, Issue , 2006, Pages 417-451

  Davidov, Dmitry ^a   Markovitch, Shaul ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

COST BENEFIT ANALYSIS; FUNCTION EVALUATION; LEARNING SYSTEMS; ONLINE SYSTEMS; TREES (MATHEMATICS);

HEURISTIC SEARCH; MARGINAL UTILITY; MULTIPLE GOAL SEARCH ALGORITHMS; STATE FEATURE SPACE;

HEURISTIC METHODS;

EID: 33749021679     PISSN: 10769757     EISSN: 10769757     Source Type: Journal    
DOI: 10.1613/jair.1940     Document Type: Article

References (46)

1. Boddy, M., & Dean, T. L. (1994). Deliberation scheduling for problem solving in time constrained environments. Artificial Intelligence, 67(2), 245-285.
2. Borodin, A., Roberts, G. O., Rosenthal, J. S., & Tsaparas, P. (2001). Finding authorities and hubs from link structures on the www. In The 10th International WWW conference, pp. 415-429. ACM Press.
3. Boyan, J., Freitag, D., &: Joachims, T. (1996). A machine learning architecture for optimizing web search engines. In Proceedings of the AAAI Workshop on Internet-Based Information Systems, pp. 324-335.
4. Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, P. J. (1984). Classification and Regression Trees. Wadsworth International, Monterey, CA.
5. Brin, S., & Page, L. (1998). The anatomy of a large-scale hypertextual Web search engine. Computer Networks and ISDN Systems, 30(1-7), 107-117.
6. Chakrabarti, S., van den Berg, M., & Dom, B. (1999). Focused crawling: a new approach to topic-specific Web resource discovery. Computer Networks, 51(11-16), 1623-1640.
7. Cho, J., & Garcia-Molina, H. (2000). The evolution of the Web and implications for an incremental crawler. In El Abbadi, A., Brodie, M. L., Chakravarthy, S., Dayal, U., Kamel, N., Schlageter, G., & Whang, K.-Y. (Eds.), VLDB 2000, pp. 200-209, Los Altos, CA 94022, USA. Morgan Kaufmann Publishers.
8. Cho, J., Garcia-Molina, H., & Page, L. (1998). Efficient crawling through URL ordering. Computer Networks and ISDN Systems, 30(1-7), 161-172.
9. Cooper, C., & Frieze, A. (2002). Crawling on web graphs. In Proceedings of STOC, pp. 419-427.
10. Cover, T. M., & Hart, P. E. (1967). Nearest neighbor pattern classification. IEEE Transactions on Information Theory, 13, 21-27.
11. Culberson, J. C., & Schaeffer, J. (1998). Pattern databases. Computational Intelligence, 14(4), 318-334.
12. Diligenti, M., Coetzee, F., Lawrence, S., Giles, C. L., & Gori, M. (2000). Focused crawling using context graphs. In 26th International Conference on Very Large Databases, VLDB 2000, pp. 527-534, Cairo, Egypt.
13. Douglis, F., Feldmann, A., Krishnamurthy, B., & Mogul, J. C. (1997). Rate of change and other metrics: a live study of the www. In USENIX Symposium on Internet Technologies and Systems, pp. 147-158.
14. Gasser, R. U. (1995). Harnessing Computational Resources for Efficient Exhaustive Search. Ph.D. thesis, ETH, Swiss Federal Institute of Technology, Zurich, Switzerland.
15. Hansen, E. A., & Zilberstein, S. (1996). Monitoring the progress of anytime problem-solving. In Proceedings of the Thirteenth National Conference on Artificial Intelligence (AAAI96), pp. 1229-1234, Portland, Oregon, USA. AAAI Press / The MIT Press.
16. Haveliwala, T. (1999). Efficient computation of PageRank. Tech. rep. 1999-31.
17. Held, M., & Karp, R. M. (1970). The traveling salesman problem and minimum spanning trees. Operations Research, 18, 1138-1162.
18. Hirai, J., Raghavan, S., Garcia-Molina, H., & Paepcke, A. (2000). Webbase: A repository of web pages. In Proceedings of the 9th International WWW Conference, pp. 277-293.
19. Hovitz, E. (1990). Computation and Action under Bounded Resources. Ph.D. thesis, Stanford University.
20. Joachims, T. (1997). A probabilistic analysis of the Rocchio algorithm with TFIDF for text categorization. In Proc. 14th International Conference on Machine Learning, pp. 143-151. Morgan Kaufmann.
21. Kleinberg, J. M. (1999). Authoritative sources in a hyperlinked environment. Journal of the ACM, 46(5), 604-632.
22. Korf, R. E., & Zhang, W. (2000). Divide-and-conquer frontier search applied to optimal sequence allignment. In National Conference on Artificial Intelligence (AAAI), pp. 910-916.
23. Korf, R. E., & Feiner, A. (2002). Disjoint pattern database heuristics. Artificial Intelligence, 134(1-2), 9-22.
24. Kumar, R., Raghavan, P., Rajagopalan, S., Sivakumar, D., Tomkins, A., & Upfal, E. (2000). The Web as a graph. In Proc. 19th Symp. Principles of Database Systems, PODS, pp. 1-10. ACM Press.
25. Lawrence, S., & Giles, C. L. (1998). Searching the WWW. Science, 250(5360), 98-100.
26. McCallum, A., Nigam, K., Rennie, J., & Seymore, K. (1999). Building domain-specific search engines with machine learning techniques. In Proc. AAAI-99 Spring Symposium on Intelligent Agents in Cyberspace, pp. 28-39.
27. Menczer, F., Pant, G., Srinivasan, P., & Ruiz, M. (2001). Evaluating topic-driven web crawlers. In Proceedings of SIGIR-01), pp. 241-249, New York. ACM Press.
28. Montgomery, D. C. (2001). Design and Analysis of Experiments (5 edition). John Wiley and Sons.
29. Mostow, J., & Prieditis, A. E. (1989). Discovering admissible heuristics by abstracting and optimizing: a transformational approach. In Proceedings of IJCAI-89, Vol. 1, pp. 701-707.
30. Najork, M., & Wiener, J. L. (1998). A technique for measuring the relative size and overlap of public web search engines. In Proceedings of the Seventh International WWW Conference/WWW7J, PP- 379-388.
31. Najork, M., & Wiener, J. L. (2001). Breadth-first crawling yields high-quality pages. In Proceedings of the 10th International WWW Conference, pp. 114-118.
32. Page, L., Brin, S., Motwani, R., & Winograd, T. (1998). The pagerank citation ranking: Bringing order to the web. Tech. rep., Stanford Digital Library Technologies Project.
33. Pandurangan, G., Raghavan, P., & Upfal, E. (2002). Using PageRank to Characterize Web Structure. In 8th Annual International Computing and Combinatorics Conference (COCOON), pp. 330-339.
34. Pearl, J., & Kim, J. H. (1982). Studies in semi-admissible heuristics. IEEE 'Transactions on Pattern Analysis and Machine Intelligence, 4(4), 392-399.
35. Prieditis, A. E. (1993). Machine discovery of effective admissible heuristics.. 12(1-3), 117-141.
36. Rennie, J., & McCallum, A. K. (1999). Using reinforcement learning to spider the Web efficiently. In Bratko, I., & Dzeroski, S. (Eds.), Proceedings of ICML-99, 16th International Conference on Machine Learning, pp. 335-343, Bled, SL. Morgan Kaufmann Publishers, San Francisco, US.
37. Russell, S. J., & Zilberstein, S. (1991). Composing real-time systems. In Proceedings of IJCAI-91, pp. 213-217, Sydney. Morgan Kaufmann.
38. Russell, S., &: Norvig, P. (2003). Artificial Intelligence: A Modern Approach (2nd edition edition). Prentice-Hall, Englewood Cliffs, NJ.
39. Salton, G., & Buckley, C. (1988). Term weighting approaches in automatic text retrieval. Information Processing and Management, 24(5), 513-523.
40. Schroedl, S. (2005). An improved search algorithm for optimal multiple-sequence alignment. Journal of Artificial Intelligence Research, 23, 587-623.
41. Utgoff, P. (1988). An incremental ID3. In Fifth International Conference on Machine Learning, pp. 107-120. Morgan Kaufmann.
42. Yoshizumi, T., Miura, T., & Ishida, T. (2000). A * with partial expansion for large branching factor problems. In AAAI/IAAI, pp. 923-929.
43. Zhou, R., & Hansen, E. A. (2002). Multiple sequence alignment using anytime a*. In Proceedings of the Eighteenth National Conference on Artificial Intelligence, pp. 975-976, Edmonton, Alberta, Canada.
44. Zhou, R., & Hansen, E. A. (2003). Sweep a*: Space-efficient heuristic search in partially ordered graphs. In Proceedings of the 15th IEEE International Conference on Tools with Artificial Intelligence, pp. 427-434, Sacramento, CA.
45. Zilberstein, S. (1996). Using anytime algorithms in intelligent systems. AI Magazine, 17(3), 73-83.
46. Zilberstein, S., Charpillet, F., & Chassaing, P. (1999). Real-time problem-solving with contract algorithms. In IJCAI, pp. 1008-1015.