Normal view MARC view

The Complexity of rapid learning in discrete event simulation

Author: Yücesan, Enver ; Jacobson, Sheldon H.INSEAD Area: Technology and Operations ManagementIn: IIE Transactions, vol. 29, 1997 Language: EnglishDescription: p. 783-790.Type of document: INSEAD ArticleNote: Please ask us for this itemAbstract: Sensitivity analysis and optimization of discrete event simulation models require the ability to efficiently estimate performance measures under different parameter settings. One technique, termed rapid learning, aims at enumerating all possible sample paths of such models. There are two necessary conditions for this capability: observability and constructability. This paper shows that the verification of the observability condition is an NP-hard search problem; this result encourages the development of heuristic procedures to validate the applicability of rapid learning. Further implications are also discussed
Tags: No tags from this library for this title. Log in to add tags.
Item type Current location Call number Status Date due Barcode Item holds
INSEAD Article Europe Campus
Available BC004054
Total holds: 0

Ask Qualtrics

Sensitivity analysis and optimization of discrete event simulation models require the ability to efficiently estimate performance measures under different parameter settings. One technique, termed rapid learning, aims at enumerating all possible sample paths of such models. There are two necessary conditions for this capability: observability and constructability. This paper shows that the verification of the observability condition is an NP-hard search problem; this result encourages the development of heuristic procedures to validate the applicability of rapid learning. Further implications are also discussed

Digitized

There are no comments for this item.

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