Asynchronous Teams

  • Sarosh Talukdar
  • Sesh Murthy
  • Rama Akkiraju
Chapter
Part of the International Series in Operations Research & Management Science book series (ISOR, volume 57)

Keywords

Nash Equilibrium Autonomous Agent Software Agent Pareto Solution Paper Machine 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in to check access.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    P.E. Gill and W. Murray (eds.) (1974) Numerical Methods for Constrained Optimization. Academic Press.Google Scholar
  2. [2]
    S.S. Pyo (1985) Asynchronous Procedures for Distributed Processing. Ph.D. dissertation, CMU.Google Scholar
  3. [3]
    P.S. deSouza (1993) Asynchronous Organizations for Multi-Algorithm Problems. Ph.D. dissertation, CMU.Google Scholar
  4. [4]
    S. Sachdev (1998) An exploration of A-teams. Ph.D. dissertation, CMU.Google Scholar
  5. [5]
    A. Smith (1776) The Wealth of Nations.Google Scholar
  6. [6]
    G. Debreu (1959) The Theory of Value. Wiley, New York.Google Scholar
  7. [7]
    S.N. Talukdar (1999) Collaboration rules for autonomous software agents. The International Journal of Decision Support Systems, 24, 269–278.Google Scholar
  8. [8]
    R. Akkiraju, P. Keskinocak, S. Murthy and F. Wu (1998) An agent-based approach for multi-machine scheduling. Proceedings of the Tenth Annual Conference on Innovative Applications of Artificial Intelligence, Menlo Park, CA.Google Scholar
  9. [9]
    C. Biermann (1993) Essentials of Pulping and Papermaking. Academic Press, San Diego.Google Scholar
  10. [10]
    H. Dyckhoff (1990) A typology of cutting and packing problems. European Journal of Operational Research, 44, 145–159.CrossRefMATHMathSciNetGoogle Scholar
  11. [11]
    P.C. Gilmore and R.E. Gomory (1961) A linear programming approach to the cutting stock problem. Operations Research, 9, 849–859.MathSciNetGoogle Scholar
  12. [12]
    R.W. Haessler (1980) A note on the computational modifications to the GilmoreGomory cutting stock algorithm. Operations Research, 28, 1001–1005.MATHMathSciNetGoogle Scholar
  13. [13]
    R.W. Haessler and P.E. Sweeney (1991) Cutting stock problems and solution procedures. European Journal of Operational Research, 54, 141–150.CrossRefGoogle Scholar
  14. [14]
    P. Keskinocak, F. Wu, R. Goodwin, S. Murthy, R. Akkiraju, S. Kumaran and A. Derebail (2002) Scheduling solutions for the paper industry. Operations Research, 50(2), 249–259.CrossRefGoogle Scholar
  15. [15]
    S. Murthy (1992) Synergy in cooperating agents: designing manipulators from task specifications. Ph.D. thesis. Carnegie Mellon University, Pittsburgh, Pennsylvania.Google Scholar
  16. [16]
    S. Murthy, R. Akkiraju, R. Goodwin, P. Keskinocak, J. Rachlin, F. Wu, S. Kumaran, J. Yeh, R. Fuhrer, A. Agarwal, M. Sturzenbecker, R. Jayaraman and R. Daigle (1999) Cooperative multi-objective decision-support for the paper industry. Interfaces, 29, 5–30.Google Scholar
  17. [17]
    M. Shaw (1998) Madison streamlines business processes with integrated information system. Pulp & Paper, 72(5), 73–81.Google Scholar
  18. [18]
    S. Talukdar, L. Baerentzen, A. Gove and P. deSouza (1998) Asynchronous teams: cooperation schemes for autonomous agents. Journal of Heuristics, 4, 295–321.CrossRefGoogle Scholar
  19. [19]
    P.P. Grassé (1967) Nouvelle expériences sur le termite de Muller (macrotermes mülleri) et considérations sur la théorie de la stigmergie. Insectes Sociaux, 14(1), 73–102.sCrossRefGoogle Scholar

Copyright information

© Kluwer Academic Publishers 2003

Authors and Affiliations

  • Sarosh Talukdar
    • 1
  • Sesh Murthy
    • 2
  • Rama Akkiraju
    • 2
  1. 1.Carnegie Mellon UniversityUSA
  2. 2.T. J. Watson Labs, IBMUSA

Personalised recommendations