Stage-oe-small.jpg

Inproceedings1682: Unterschied zwischen den Versionen

Aus Aifbportal
Wechseln zu:Navigation, Suche
K (Added from ontology)
 
Zeile 5: Zeile 5:
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=2
 
|Rank=2
|Author=S. Chick
+
|Author=Steve Chick
 
}}
 
}}
 
{{Publikation Author
 
{{Publikation Author
 
|Rank=3
 
|Rank=3
|Author=C Schmidt
+
|Author=Christian Schmidt
 
}}
 
}}
 
{{Inproceedings
 
{{Inproceedings
Zeile 26: Zeile 26:
 
|VG Wort-Seiten=27
 
|VG Wort-Seiten=27
 
|Link=http://www.informs-sim.org/wsc07papers/033.pdf
 
|Link=http://www.informs-sim.org/wsc07papers/033.pdf
|DOI Name=
+
|Forschungsgruppe=Effiziente Algorithmen
|Projekt=
 
|Forschungsgruppe=
 
 
}}
 
}}
 
{{Forschungsgebiet Auswahl
 
{{Forschungsgebiet Auswahl
 
|Forschungsgebiet=Entscheidungsunterstützende Systeme
 
|Forschungsgebiet=Entscheidungsunterstützende Systeme
 
}}
 
}}

Aktuelle Version vom 24. September 2009, 21:43 Uhr


New greedy myopic and existing asymptotic sequential selection proceedures: Preliminary empirical results


New greedy myopic and existing asymptotic sequential selection proceedures: Preliminary empirical results



Published: 2007
Herausgeber: S. G. Henderson et al.
Buchtitel: Proceedings of the Winter Simulation Conference
Seiten: 289-296
Verlag: IEEE Press

Referierte Veröffentlichung

BibTeX

Kurzfassung
Statistical selection procedures can identify the best of a finite set of alternatives, where ``best is defined in terms of the unknown expected value of each alternative's simulation output. One effective Bayesian approach allocates samples sequentially to maximize an approximation to the expected value of information (EVI) from those samples. That existing approach uses both asymptotic and probabilistic approximations. This paper presents new EVI sampling allocations that avoid most of those approximations, but that entail sequential myopic sampling from a single alternative per stage of sampling. We compare the new and old approaches empirically. In some scenarios (a small, fixed total number of samples, few systems to be compared), the new greedy myopic procedures are better than the original asymptotic variants. In other scenarios (with adaptive stopping rules, medium or large number of systems, high required probability of correct selection), the original asymptotic allocations perform better.

VG Wort-Seiten: 27
Weitere Informationen unter: Link



Forschungsgruppe

Effiziente Algorithmen


Forschungsgebiet

Entscheidungsunterstützende Systeme