Applied Probability-Computer Science: The Interface Volume 1: Progress in Computer Science and Applied Logic, cartea 2
Autor Ralph L. Disney, Teunis J. Otten Limba Engleză Hardback – 1982
Toate formatele și edițiile | Preț | Express |
---|---|---|
Paperback (1) | 379.47 lei 6-8 săpt. | |
Birkhäuser Boston – 17 oct 2011 | 379.47 lei 6-8 săpt. | |
Hardback (1) | 389.31 lei 6-8 săpt. | |
Birkhäuser Boston – 1982 | 389.31 lei 6-8 săpt. |
Din seria Progress in Computer Science and Applied Logic
- 20% Preț: 324.79 lei
- Preț: 360.31 lei
- 20% Preț: 316.04 lei
- 20% Preț: 966.36 lei
- 15% Preț: 560.10 lei
- 20% Preț: 322.62 lei
- 20% Preț: 611.79 lei
- 20% Preț: 317.15 lei
- 20% Preț: 621.24 lei
- Preț: 367.42 lei
- 15% Preț: 557.04 lei
- 20% Preț: 555.77 lei
- 20% Preț: 449.86 lei
- Preț: 373.08 lei
- Preț: 382.56 lei
- 15% Preț: 612.63 lei
- 15% Preț: 612.34 lei
- 20% Preț: 612.68 lei
- 20% Preț: 321.83 lei
- 15% Preț: 662.05 lei
- 15% Preț: 619.30 lei
- 18% Preț: 692.18 lei
- Preț: 378.35 lei
- 20% Preț: 420.91 lei
- 20% Preț: 317.46 lei
- Preț: 359.95 lei
- Preț: 361.04 lei
- 20% Preț: 317.28 lei
Preț: 389.31 lei
Nou
Puncte Express: 584
Preț estimativ în valută:
74.53€ • 80.75$ • 62.24£
74.53€ • 80.75$ • 62.24£
Carte tipărită la comandă
Livrare economică 12-26 decembrie
Preluare comenzi: 021 569.72.76
Specificații
ISBN-13: 9780817630676
ISBN-10: 0817630678
Pagini: 505
Ilustrații: XXVIII, 505 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.95 kg
Ediția:1982
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
ISBN-10: 0817630678
Pagini: 505
Ilustrații: XXVIII, 505 p.
Dimensiuni: 155 x 235 x 33 mm
Greutate: 0.95 kg
Ediția:1982
Editura: Birkhäuser Boston
Colecția Birkhäuser
Seria Progress in Computer Science and Applied Logic
Locul publicării:Boston, MA, United States
Public țintă
ResearchCuprins
Major Speakers.- Networks of Quasi-Reversible Nodes.- The c — Server Queue with Constant Service Times and a Versatile Markovian Arrival Process.- Simulation Output Analysis for General State Space Markov Chains.- Models and Problems of Dynamic Memory Allocation.- Probabilistic Analysis of Algorithms.- Point Process Method in Queueing Theory.- Error Minimization in Decomposable Stochastic Models.- Computational Methods for Product Form Queueing Networks: Extended Abstract.- Networks of Queues, I Richard Muntz, Chairman.- Closed Multichain Product Form Queueing Networks with Large Population Sizes.- The Significance of the Decomposition and the Arrival Theorems for the Evaluation of Closed Queueing Networks.- On Computing the Stationary Probability Vector of a Network of Two Coxian Servers.- Performance and Reliability Donald Gross, Chairman.- Fitting of Software Error and Reliability Models to Field Failure Data.- Performance Evaluation of Voice/Data Queueing Systems.- Probabilistic Aspects of Simulation Peter Lewis, Chairman.- On a Spectral Approach to Simulation Run Length Control.- Generation of Some First-Order Autoregressive Markovian Sequences of Positive Random Variables with Given Marginal Distributions.- Testing for Initialization Bias in the Mean of a Simulation Output Series: Extended Abstract.- Queueing Models in Performance Analysis, I Daniel Heyman, Chairman.- Response Time Analysis for Pipelining Jobs in a Tree Network of Processors.- Mean Delays of Individual Streams into a Queue: The ?GIi/M/1 Queue.- Probabilistic Models in Performance Analysis of Computer Systems and Communication Networks Donald Gaver, Chairman.- Analysis and Design of Processor Schedules for Real Time Applications.- Modeling Real Dasd Configurations.- Bottleneck Determination inNetworks of Queues.- Probabilistic Analysis of Algorithms Dave Liu, Chairman.- On the Average Difference Between the Solutions to Linear and Integer Knapsack Problems.