default search action
Discrete Event Dynamic Systems, Volume 10
Volume 10, Numbers 1-2, January 2000
- Qian-Yu Tang, Han-Fu Chen:
Central Limit Theorems for Stochastic Optimization Algorithms Using Infinitesimal Perturbation Analysis. 5-32 - Rami Debouk, Stéphane Lafortune, Demosthenis Teneketzis:
Coordinated Decentralized Protocols for Failure Diagnosis of Discrete Event Systems. 33-86 - Anuj Puri:
Dynamical Properties of Timed Automata. 87-113 - Xiuli Chao, Shaohui Zheng:
Triggered Concurrent Batch Arrivals and Batch Departures in Queueing Networks. 115-129 - K. C. Wong, John G. Thistle, Roland P. Malhamé, Hai Hoc Hoang:
Supervisory Control of Distributed Systems: Conflict Resolution. 131-186
Volume 10, Number 3, July 2000
- Yu-Chi Ho:
Editorial. 199 - Bernd Heidergott:
Customer-Oriented Finite Perturbation Analysis for Queueing Networks. 201-232 - Haoxun Chen:
Control Synthesis of Petri Nets Based on S-Decreases. 233-249 - Chun-Hung Chen, Jianwu Lin, Enver Yücesan, Stephen E. Chick:
Simulation Budget Allocation for Further Enhancing the Efficiency of Ordinal Optimization. 251-270 - Leyuan Shi:
A New Algorithm for Stochastic Discrete Resource Allocation Optimization. 271-294
Volume 10, Number 4, October 2000
- Kelly A. Sullivan, Sheldon H. Jacobson:
Ordinal Hill Climbing Algorithms for Discrete Manufacturing Process Design Optimization Problems. 307-324 - Hervé Marchand, Patricia Bournai, Michel Le Borgne, Paul Le Guernic:
Synthesis of Discrete-Event Controllers Based on the Signal Environment. 325-346 - Eric Menguy, Jean-Louis Boimond, Laurent Hardouin, Jean-Louis Ferrier:
A First Step Towards Adaptive Control for Linear Systems in Max Algebra. 347-367 - Subiono, Jacob van der Woude:
Power Algorithms for (max, +)- and Bipartite (min, max, +)-Systems. 369-389
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.