Normal view MARC view

Complexity of simulation models: a graph theoretic approach

Author: Yücesan, Enver ; Schruben, LeeINSEAD Area: Technology and Operations ManagementIn: Journal on Computing, vol. 10, no. 1, winter 1998 Language: EnglishDescription: p. 94-106.Type of document: INSEAD ArticleNote: Please ask the Library for this articleAbstract: Complexity of a simulation model is defined as a measure that reflects the requirements imposed by models on computational resources. Moreover, they are often related to structural properties of models. In this paper, complexity measures for simulations using the concept of Simulation Graph Models are developed. A reasonable measure of complexity is useful in a priori evaluation of proposed simulation studies. They can also be useful in classifying simulation models in order to obtain a thorough test bed of models to be used in simulation methodology research. Some measures of run time complexity are also developed. In paricular, we provide estimates for the size of the future events list (or the pending even set). The proposed metrics are illustrated and compared through a limited set of examples. Limitations of the current approach as well as directions for future research are discussed
Tags: No tags from this library for this title. Add tag(s)
Log in to add tags.
Item type Current location Call number Status Date due
INSEAD Article Doriot Library
Available

Please ask the Library for this article

Complexity of a simulation model is defined as a measure that reflects the requirements imposed by models on computational resources. Moreover, they are often related to structural properties of models. In this paper, complexity measures for simulations using the concept of Simulation Graph Models are developed. A reasonable measure of complexity is useful in a priori evaluation of proposed simulation studies. They can also be useful in classifying simulation models in order to obtain a thorough test bed of models to be used in simulation methodology research. Some measures of run time complexity are also developed. In paricular, we provide estimates for the size of the future events list (or the pending even set). The proposed metrics are illustrated and compared through a limited set of examples. Limitations of the current approach as well as directions for future research are discussed

Digitized

There are no comments for this item.

Log in to your account to post a comment.
Koha 3.18 - INSEAD Library Catalogue
Library Home | Contact Us | What's Koha?