Abstract
A Complex System (DEF 2.1) includes elements of two opposing sides that pursue opposing goals by trying to reach different sets of target states. This is a natural conflict. Problems presented in Chapters 3–6 include various examples of such a conflict. In this chapter, we consider a computationally intensive problem without a natural conflict. To apply the LG tools, we map this problem into the class of Complex Systems by introducing an artificial conflict as an abstract board game of two opposing teams of artificial mobile agents.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Science+Business Media New York
About this chapter
Cite this chapter
Stilman, B. (2000). Scheduling: Artificial Conflict. In: Linguistic Geometry. Operations Research/Computer Science Interfaces Series, vol 13. Springer, Boston, MA. https://doi.org/10.1007/978-1-4615-4439-5_7
Download citation
DOI: https://doi.org/10.1007/978-1-4615-4439-5_7
Publisher Name: Springer, Boston, MA
Print ISBN: 978-1-4613-6999-8
Online ISBN: 978-1-4615-4439-5
eBook Packages: Springer Book Archive