Joseph Pemberton's Available Papers Page

Available Papers

The following is a list of my recent papers, some of which are available electronically. Please let me know if you access one of my papers, and I would also appreciate receiving any comments that you might have. (joseph.pemberton(insert at-sign here)veridian.com.)
  1. J. C. Pemberton ``Incremental Search Methods for Real-Time Decision Making,'' PhD Dissertation, Computer Science Department, University of California, Los Angeles, March 1995. (read the abstract) or (request the complete document (large))

  2. J. C. Pemberton ``k-best: A New Method for Real-Time Decision Making,'' to appear in Proceedings of the 1995 International Joint Conference on Artificial Intelligence (IJCAI-95) . (read it)

  3. J. C. Pemberton and W. Zhang (1996) Epsilon-transformation: Exploiting Phase Transitions to solve combinatorial optimization problems, Artificial Intelligence, special issue on Frontiers in Problem Solving: Phase Transitions and Complexity, 81(1-2), 1996, pp.297-325.

  4. W. Zhang and J. C. Pemberton (1994) Epsilon-transformation: Exploiting complexity transitions to solve combinatorial optimization problems - Initial results, Proc. 12th National Conf. on Artificial Intelligence (AAAI-94), Seattle, WA, July 31-Aug. 4, 1994, pp.895-900. (Due to a possible infringement of AAAI copyright by WWW distribution, please request a copy of this by email (pemberto@cs.ucla.edu)).

  5. J. C. Pemberton and R. E. Korf, ``Incremental Search Algorithms for Real-Time Decision Making,'' Proceedings of the Second Annual Conference on AI Planning Systems (AIPS-94), Chicago, June 1994. (read it)

  6. R.E. Korf, J. C. Pemberton and W. Zhang (1994) Incremental Random Search Trees, Working Notes of AAAI-94 Workshop on Experimental Evaluation of Reasoning and Search Methods, Seattle, WA, Aug. 1, 1994, pp.15-18.

  7. J. C. Pemberton and R. E. Korf, ``An Incremental Search Approach to Real-Time Decision Making,'' Proceedings of the AAAI Spring Symposium on Decision Theoretic Planning, Stanford, March 1994. (read it).

  8. J. C. Pemberton and R. E. Korf, ``An Incremental Search Approach to Real-Time Planning: Preliminary Results for a Scheduling Problem,'' Proceedings of the AAAI Spring Symposium on Foundations of Automatic Planning: The Classical Approach and Beyond, Stanford, CA, March 1993. AAAI Press Technical Report No. SS-93-03.

  9. J. C. Pemberton and R. E. Korf, ``An Incremental Search Approach to Real-Time Planning and Scheduling: Preliminary Results,'' Working Notes of the NSF Workshop on Intelligent, Dynamic Scheduling for Manufacturing Systems, Cocoa Beach, FL, January 1993.

  10. J. C. Pemberton and R. E. Korf, ``Incremental Planning on Graphs with Cycles,'' Proceedings of the First International Conference on AI Planning Systems (AIPS-92), (Editor: J. Hendler), June 1992.

  11. J. C. Pemberton and R. E. Korf, ``Making Locally Optimal Decisions on Graphs with Cycles,'' UCLA Computer Science Department Technical Report No. UCLA-CSD-920004, January 1992. (read it).

  12. C. M. Reed, W. M. Rabinowitz, N. I. Durlach, L. A. Delhorne, L. D. Braida, J. C. Pemberton, B. D. Mulcahey and D. L. Washington, ``Analytic Study of the Tadoma Method: Improving Performance Through the Use of Supplementary Tactual Displays,'' Journal of Speech and Hearing Research, Volume 35, p. 450-465, April 1992.

Return to my home page.