default search action
21st Annual Simulation Symposium 1988: Tampa, Florida, USA
- Michael A. Abrams:
Proceedings 21st Annual Simulation Symposium (ANSS-21 1988), Tampa, Florida, USA, 1988. IEEE Computer Society 1988, ISBN 0-8186-0845-5 - Bevlee A. Watford, Delbert L. Kimbler:
A proposed college curriculum in simulation. 1-9 - John E. Melde, Philip G. Gage:
Ada simulation technology - methods and metrics. 11-36 - James F. Engler:
System-level simulation of a next generation, multi-sensor concurrent signal processor. 37-52 - Ben Pinkowski:
Performance of clustering algorithms on time-dependent spatial patterns. 53-69 - Rolf Schmidt:
Application of simulation for order sequencing in flow-shop production systems. 71-89 - Dimitrios A. Andreou:
Optimization of the traveling sequence of a "pick and place" robot by simulating its operation as a traveling salesman problem. 91-105 - James V. Leonard, Angela K. Scharf, George W. Zobrist:
The heuristic arilaunch trainer. 107-120 - Jehan-François Pâris, Darrell D. E. Long, Alexander Glockner:
A realistic evaluation of consistency algorithms for replicated files. 121-130 - John F. Cigas:
Efficient and realistic simulation of disk cache performance. 131-141 - D. Peter Sanderson, Lawrence L. Rose:
Object-oriented modeling using C++. 143-156 - Lieh-san Lin, James Calhoun:
Mathematical modeling and simulation of an algorithm for optimistic concurrency control in centralized database systems. 157-169 - Ross A. Gagliano, Martin D. Fraser, Mark E. Schaefer:
Simulation of a market model for distributed control. 171-187 - Max Mühlhäuser:
Using distributed simulation for distributed application development. 189-206 - Wayne F. Zimmerman, Chung-I Wu:
Real-time hierarchically distributed processing network interaction simulation. 207-226
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.