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
Din seria Progress in Computer Science and Applied Logic
- 20%
Preț: 329.74 lei -
Preț: 368.16 lei - 20%
Preț: 319.28 lei - 24%
Preț: 904.96 lei - 15%
Preț: 568.52 lei - 20%
Preț: 327.48 lei - 20%
Preț: 661.59 lei - 20%
Preț: 321.98 lei - 20%
Preț: 624.19 lei -
Preț: 373.03 lei - 20%
Preț: 564.08 lei - 20%
Preț: 456.63 lei -
Preț: 378.78 lei -
Preț: 388.43 lei - 15%
Preț: 621.80 lei - 15%
Preț: 621.48 lei - 20%
Preț: 325.72 lei - 15%
Preț: 668.55 lei - 15%
Preț: 626.11 lei - 18%
Preț: 701.91 lei -
Preț: 384.13 lei - 20%
Preț: 485.40 lei - 20%
Preț: 321.97 lei -
Preț: 367.68 lei -
Preț: 368.53 lei - 20%
Preț: 321.74 lei
Preț: 395.25 lei
Puncte Express: 593
Carte tipărită la comandă
Livrare economică 30 iulie-13 august
Livrare prin curier în România Termenul estimat este afișat lângă disponibilitate.
Transport gratuit de la 400.00 lei Plată online sau ramburs, în funcție de opțiunile comenzii.
Retur gratuit în 14 zile Comandă securizată și suport în română.
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.