Skip to main content

Autonomous-Centered Problem Allocation Oriented to Cooperation

  • Conference paper
Advanced Parallel Processing Technologies (APPT 2005)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 3756))

Included in the following conference series:

  • 653 Accesses

Abstract

By reasonably allocating a cooperative problem which need multiple solvers cope with together, the problem could be performed more effectively and efficiently. A problem could be divided into multiple sub-problems; each has certain ability requirement which is the hinge to relate problem and solver. According to ability requirement, the solver candidate set for each sub-problem could be established. To select suitable solver from candidate set so as to solve a cooperative problem in more autonomous and consistent way, a mathematical allocation model taking the minimization of interaction number as objective function is established. The model solving process is deployed by decreasing two kinds of interactions, i.e. intra-interaction and extra-interaction. Experiment shows this method obtains better performance than general allocation.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Rogers, E.: Cognitive cooperation through visual interaction. Int. J. Knowledge-Based Systems, 117–125 (1995)

    Google Scholar 

  2. Pérez, J.A., Corchuelo, R., Ruiz, D., Toro, M.: An Order-Based, Distributed Algorithm for Implementing Multiparty Interactions. In: Arbab, F., Talcott, C. (eds.) COORDINATION 2002. LNCS, vol. 2315, pp. 250–257. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  3. Ruiz, D., Corchuelo, R., Pérez, J.A., Toro, M.: An Algorithm for Ensuring Fairness and Liveness in Non-deterministic Systems Based on Multiparty Interactions. In: Monien, B., Feldmann, R.L. (eds.) Euro-Par 2002. LNCS, vol. 2400, pp. 563–572. Springer, Heidelberg (2002)

    Chapter  Google Scholar 

  4. Sanchis, L.E.: Set theory, an operational approach. Gordon and Breach, Amsterdam (1996)

    MATH  Google Scholar 

  5. Sova, J.F.: Knowledge Representation: Logical, Philosophical, and Computational Foundations. Brooks/Cole (2000)

    Google Scholar 

  6. Minyi, Y.: Introduction to Combinatorial Optimization. Zhejiang Science & Technology Publishing House (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2005 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Liu, X., Dou, W., Chen, G., Cai, S., Tang, J. (2005). Autonomous-Centered Problem Allocation Oriented to Cooperation. In: Cao, J., Nejdl, W., Xu, M. (eds) Advanced Parallel Processing Technologies. APPT 2005. Lecture Notes in Computer Science, vol 3756. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11573937_12

Download citation

  • DOI: https://doi.org/10.1007/11573937_12

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-29639-3

  • Online ISBN: 978-3-540-32107-1

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics