|Eingestellt in Kategorie:
Ähnlichen Artikel verkaufen?

REGENERATION UND NETZWERKE VON WARTESCHLANGEN (ANGEWANDTE WAHRSCHEINLICHKEIT) von Gerald S. Shedler

~ BRAND NEW!! Quick & Free Delivery in 2-14 days ~
ZUBER
(265009)
Angemeldet als gewerblicher Verkäufer
US $135,95
Ca.CHF 110,98
Artikelzustand:
Neu
Ganz entspannt. Kostenloser Versand & Rückversand.
Versand:
Kostenlos Economy Shipping.
Standort: US, USA
Lieferung:
Lieferung zwischen Mo, 23. Jun und Do, 26. Jun nach 94104 bei heutigem Zahlungseingang
Wir wenden ein spezielles Verfahren zur Einschätzung des Liefertermins an – in diese Schätzung fließen Faktoren wie die Entfernung des Käufers zum Artikelstandort, der gewählte Versandservice, die bisher versandten Artikel des Verkäufers und weitere ein. Insbesondere während saisonaler Spitzenzeiten können die Lieferzeiten abweichen.
Rücknahme:
30 Tage Rückgabe. Verkäufer zahlt Rückversand.
Zahlungen:
     Diners Club

Sicher einkaufen

eBay-Käuferschutz
Geld zurück, wenn etwas mit diesem Artikel nicht stimmt. Mehr erfahreneBay-Käuferschutz - wird in neuem Fenster oder Tab geöffnet
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:226817819698

Artikelmerkmale

Artikelzustand
Neu: Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte ...
ISBN-10
1461269970
Book Title
Regeneration and Networks of Queues (Applied Probability)
Item Height
9.21 inches
ISBN
9781461269977

Über dieses Produkt

Product Identifiers

Publisher
Springer New York
ISBN-10
1461269970
ISBN-13
9781461269977
eBay Product ID (ePID)
169590937

Product Key Features

Number of Pages
VIII, 224 Pages
Publication Name
Regeneration and Networks of Queues
Language
English
Subject
Probability & Statistics / General
Publication Year
2012
Type
Textbook
Author
Gerald S. Shedler
Subject Area
Mathematics
Series
Applied Probability Ser.
Format
Trade Paperback

Dimensions

Item Weight
12.9 Oz
Item Length
9.3 in
Item Width
6.1 in

Additional Product Features

Intended Audience
Scholarly & Professional
Series Volume Number
3
Number of Volumes
1 vol.
Illustrated
Yes
Table Of Content
1 Discrete Event Simulation.- 1.1 Methodological Considerations l.- 1.2 The Generalized Semi-Markov Process Model.- 1.3 Specification of Discrete Event Simulations.- 2 Regenerative Simulation.- 2.1 Regenerative Stochastic Processes.- 2.2 Properties of Regenerative Processes.- 2.3 The Regenerative Method for Simulation Analysis.- 2.4 Implementation Considerations.- 2.5 Theoretical Values for Discrete Time Markov Chains.- 2.6 Theoretical Values for Continuous Time Markov Chains.- 2.7 Efficiency of Regenerative Simulation.- 2.8 Regenerative Generalized Semi-Markov Processes.- 3 Markovian Networks.- 3.1. Markovian Job Stack Processes.- 3.2. Augmented Job Stack Processes.- 3.3. Irreducible, Closed Sets of Recurrent States.- 3.4. The Marked Job Method.- 3.5. Fully Augmented Job Stack Processes.- 3.6. The Labelled Jobs Method.- 3.7. Sequences of Passage Times.- 3.8. Networks with Multiple Job Types.- 3.9. Simulation for Passage Times.- 4 Non-Markovian Networks.- 4.1 Networks with Single States.- 4.2 Regenerative Simulation of Non-Markovian Networks.- 4.3 Single States for Passage Times.- 4.4 Recurrence and Regeneration.- 4.5 The Marked Job Method.- 4.6 Finite Capacity Open Networks.- 4.7 Passage Through Subnetworks.- 4.8 The Underlying Stochastic Structure.- 4.9 The Labelled Jobs Method.- 4.10 Comparison of Methods.- Appendix 1 Limit Theorems for Stochastic Processes.- Appendix 2 Convergence of Passage Times.- Symbol Index.
Synopsis
Networks of queues arise frequently as models for a wide variety of congestion phenomena. Discrete event simulation is often the only available means for studying the behavior of complex networks and many such simulations are non- Markovian in the sense that the underlying stochastic process cannot be repre- sented as a continuous time Markov chain with countable state space. Based on representation of the underlying stochastic process of the simulation as a gen- eralized semi-Markov process, this book develops probabilistic and statistical methods for discrete event simulation of networks of queues. The emphasis is on the use of underlying regenerative stochastic process structure for the design of simulation experiments and the analysis of simulation output. The most obvious methodological advantage of simulation is that in principle it is applicable to stochastic systems of arbitrary complexity. In practice, however, it is often a decidedly nontrivial matter to obtain from a simulation information that is both useful and accurate, and to obtain it in an efficient manner. These difficulties arise primarily from the inherent variability in a stochastic system, and it is necessary to seek theoretically sound and computationally efficient methods for carrying out the simulation. Apart from implementation consider- ations, important concerns for simulation relate to efficient methods for generating sample paths of the underlying stochastic process. the design of simulation ex- periments, and the analysis of simulation output., Networks of queues arise frequently as models for a wide variety of congestion phenomena. Discrete event simulation is often the only available means for studying the behavior of complex networks and many such simulations are non­ Markovian in the sense that the underlying stochastic process cannot be repre­ sented as a continuous time Markov chain with countable state space. Based on representation of the underlying stochastic process of the simulation as a gen­ eralized semi-Markov process, this book develops probabilistic and statistical methods for discrete event simulation of networks of queues. The emphasis is on the use of underlying regenerative stochastic process structure for the design of simulation experiments and the analysis of simulation output. The most obvious methodological advantage of simulation is that in principle it is applicable to stochastic systems of arbitrary complexity. In practice, however, it is often a decidedly nontrivial matter to obtain from a simulation information that is both useful and accurate, and to obtain it in an efficient manner. These difficulties arise primarily from the inherent variability in a stochastic system, and it is necessary to seek theoretically sound and computationally efficient methods for carrying out the simulation. Apart from implementation consider­ ations, important concerns for simulation relate to efficient methods for generating sample paths of the underlying stochastic process. the design of simulation ex­ periments, and the analysis of simulation output.
LC Classification Number
QA273.A1-274.9

Artikelbeschreibung des Verkäufers

Info zu diesem Verkäufer

ZUBER

97,8% positive Bewertungen952 Tsd. Artikel verkauft

Mitglied seit Okt 1998
Angemeldet als gewerblicher Verkäufer
Shop besuchenKontakt

Detaillierte Verkäuferbewertungen

Durchschnitt in den letzten 12 Monaten
Genaue Beschreibung
4.8
Angemessene Versandkosten
5.0
Lieferzeit
5.0
Kommunikation
4.9

Beliebte Kategorien in diesem Shop

Verkäuferbewertungen (292'358)

Alle Bewertungen
Positiv
Neutral
Negativ