Optimal Schedules for Parallelizing Anytime Algorithms

AAAI Fall Symposium - Technical Report

Volumn FS-01-04, Issue , 2001, Pages 49-56

  Finkelstein, Lev ^a   Markovitch, Shaul ^a   Rivlin, Ehud ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ANYTIME ALGORITHM; INITIAL STATE; LINEAR SPEED-UP; NONDETERMINISTIC ALGORITHMS; OPTIMAL SCHEDULE; OPTIMAL SCHEDULING; PARALLELIZATIONS; PARALLELIZING; PERFORMANCE; PROBLEM SPACE;

EID: 0012306196     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (19)

1. Boddy,M., and Dean, T. 1994. Decision-theoretic deliberation schedulingfor problemsolving in time-constrained environments.Artificial Intelligence 67(2):245-286.
2. Clearwater, S. H.; Hogg,T.; and Huberman,B. A. 1992. Cooperative problemsolving. In Bernardo, H., ed., Computation: The Micro and MacroView. Singapore: World Scientific. 33-70.
3. Dean, T., and Boddy, M. 1988. An analysis of time-dependent planning. In Proceedings of Seventh National Conferenceon Artificial Intelligence, 49-54.
4. Finkelstein, L., and Markovitch,S. 2001. Optimalschedules for monitoringanytimealgorithms. Artificial Intelligence 126:63-108.
5. Horvitz, E.J. 1987. Reasoningabout beliefs and actions under computational resource constraints. In Proceedings of the 1987Workshopon Uncertaintyin Artificial Intelligence.
6. Huberman,B. A.; Lukose, R. M.; and Hogg, T. 1997. An economicapproach to hard computational problems. Science 275:51-54.
7. Janakiram, V. K.; Agrawal,D. P.; and Mehrotra, R. 1988. A randomizedparallel backtracking algorithm. IEEETransactions on Computers37(12): 1665-1676.
8. Knight, K. 1993. Are manyreactive agents better than a few deliberative ones? In Proceedingsof the Thirteenth International Joint Conferenceon Artificial Intelligence, 432-437.
9. Korf, R.E. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
10. Kumar,V., and Rao, V. N. 1987. Parallel depth-first search on multiprocessorspart II: Analysis. International Journal of Parallel Programming16(6):501-519.
11. Rao, V. N., and Kumar,V. 1987. Parallel depth-first search on multiprocessors part I: Implementation. International Journal of Parallel Programming16(6):479-499.
12. Rao, V. N., and Kumar, V. 1992. Onthe efficience of parallel backtracking. IEEEtransactions on parrallel and distributed computing.
13. Russell, S., and Wefald, E. 1991. Do the Right Thing: Studies in Limited Rationality. Cambridge,Massachusetts: The MITPress.
14. Russell, S. J., and Zilberstein, S. 1991. Composing real-time systems. In Proceedingsof the Twelfth NationalJoint Conferenceon Artificial Intelligence (IJCAI-91). Sydney: Morgan Kaufmann.
15. Simon,H. A. 1955. Abehavioral modelof rational choice. Quarterly Journal of Economics69:99-118.
16. Simon, H. A. 1982. Modelsof BoundedRationality. MIT Press.
17. Yokoo,M., and Kitamura, Y. 1996. Multiagent real-time-A*with selection: Introducing competition in cooperative search. In Proceedingsof the SecondInternational Conference on Multiagent Systems (ICMAS-96), 409-416.
18. Zilberstein, S., andRussell, S. J. 1992. Efficient resource-bounded reasoning in AT-RALPH. In Proceedings of the First International Conference on AI Planning Systems, 260-266.
19. Zilberstein, S. 1993. Operational Rationality Through Compilation of Anytime Algorithms. Ph.D. Dissertation, ComputerScienceDivision, University of California, Berkeley.