Optimal schedules for parallelizing anytime algorithms: The case of independent processes

Proceedings of the National Conference on Artificial Intelligence

Volumn , Issue , 2002, Pages 719-724

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

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; COSTS; EXPERT SYSTEMS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; PROBLEM SOLVING; RESOURCE ALLOCATION; TREES (MATHEMATICS);

OPTIMAL SCHEDULES;

PARALLEL PROCESSING SYSTEMS;

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

References (25)

1. Boddy, M., and Dean, T. 1994. Decision-theoretic deliberation scheduling for problem solving in time-constrained environments. Artificial Intelligence 67(2):245-286.
2. Clearwater, S. H.; Hogg, T.; and Huberman, B. A. 1992. Cooperative problem solving. In Huberman, B., ed., Computation: The Micro and Macro View. Singapore: World Scientific. 33-70.
3. Dean, T., and Boddy, M. 1988. An analysis of time-dependent planning. In Proceedings of the Seventh National Conference on Artificial Intelligence (AAAI-88), 49-54. Saint Paul, Minnesota, USA: AAAI Press/MIT Press.
4. Finkelstein, L., and Markovitch, S. 2001. Optimal schedules for monitoring anytime algorithms. Artificial Intelligence 126:63-108.
5. Finkelstein, L.; Markovitch, S.; and Rivlin, E. 2001. Optimal schedules for parallelizing anytime algorithms. In Papers from the 2001 AAAI Fall Symposium, 49-56.
6. Finkelstein, L.; Markovitch, S.; and Rivlin, E. 2002. Optimal schedules for parallelizing anytime algorithms: The case of independent processes. Technical Report CIS-2002-04, CS department, Technion, Haifa, Israel.
7. Gomes, C. P., and Selman, B. 1997. Algorithm portfolio design: Theory vs. practice. In Proceedings of UAI-97, 190-197. San Francisco: Morgan Kaufmann.
8. Gomes, C. P.; Selman, B.; and Kautz, H. 1998. Boosting combinatorial search through randomization. In Proceedings of the 15th National Conference on Artificial Intelligence (AAAI-98), 431-437. Menlo Park: AAAI Press.
9. Horvitz, E. J. 1987. Reasoning about beliefs and actions under computational resource constraints. In Proceedings of UAI-87.
10. Huberman, B. A.; Lukose, R. M.; and Hogg, T. 1997. An economic approach to hard computational problems. Science 275:51-54.
11. Janakiram, V. K.; Agrawal, D. P.; and Mehrotra, R. 1988. A randomized parallel backtracking algorithm. IEEE Transactions on Computers 37(12): 1665-1676.
12. Knight, K. 1993. Are many reactive agents better than a few deliberative ones. In Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence, 432-437. Chambéry, France: Morgan Kaufmann.
13. Korf, R. E. 1990. Real-time heuristic search. Artificial Intelligence 42:189-211.
14. Kumar, V., and Rao, V. N. 1987. Parallel depth-first search on multiprocessors part II: Analysis. International Journal of Parallel Programming 16(6): 501-519.
15. Luby, M., and Ertel, W. 1994. Optimal parallelization of Las Vegas algorithms. In Proceedings of the Annual Symposium on the Theoretical Aspects of Computer Science (STACS '94), 463-474. Berlin, Germany: Springer.
16. Luby, M.; Sinclair, A.; and Zuckerman, D. 1993. Optimal speedup of las vegas algorithms. Information Processing Letters 47:173-180.
17. Rao, V. N., and Kumar, V. 1987. Parallel depth-first search on multiprocessors part I: Implementation. International Journal of Parallel Programming 16(6):479-499.
18. Rao, V. N., and Kumar, V. 1993. On the efficiency of parallel backtracking. IEEE Transactions on Parallel and Distributed Systems 4(4):427-437.
19. Russell, S., and Wefald, E. 1991. Do the Right Thing: Studies in Limited Rationality. Cambridge, Massachusetts: The MIT Press.
20. Russell, S. J., and Zilberstein, S. 1991. Composing real-time systems. In Proceedings of the Twelfth National Joint Conference on Artificial Intelligence (IJCAI-91), 212-217. Sydney: Morgan Kaufmann.
21. Simon, H. A. 1955. A behavioral model of rational choice. Quarterly Journal of Economics 69:99-118.
22. Simon, H. A. 1982. Models of Bounded Rationality. MIT Press.
23. Yokoo, M., and Kitamura, Y. 1996. Multiagent real-time-A* with selection: Introducing competition in cooperative search. In Proceedings of the Second International Conference on Multiagent Systems (ICMAS-96), 409-416.
24. Zilberstein, S., and Russell, S. J. 1992. Efficient resource-bounded reasoning in AT-RALPH. In Proceedings of the First International Conference on AI Planning Systems, 260-266.
25. Zilberstein, S. 1993. Operational Rationality Through Compilation of Anytime Algorithms. Ph.D. Dissertation, Computer Science Division, University of California, Berkeley.