ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Articles  (3)
  • Articles: DFG German National Licenses  (3)
  • Latest Papers from Table of Contents or Articles in Press
  • Markov decision processes  (2)
  • Approximations  (1)
  • Springer  (3)
  • American Chemical Society (ACS)
  • EMBO Press
  • 2020-2024
  • 2015-2019
  • 1985-1989  (3)
  • 1980-1984
  • 1970-1974
  • 1965-1969
  • 1987  (3)
  • 1970
  • 1935
  • Economics  (3)
  • Natural Sciences in General
Collection
  • Articles  (3)
Source
  • Articles: DFG German National Licenses  (3)
  • Latest Papers from Table of Contents or Articles in Press
Keywords
Publisher
  • Springer  (3)
  • American Chemical Society (ACS)
  • EMBO Press
Years
  • 2020-2024
  • 2015-2019
  • 1985-1989  (3)
  • 1980-1984
  • 1970-1974
    • +
Year
  • 1987  (3)
  • 1970
  • 1935
Topic
  • 1
    Electronic Resource
    Electronic Resource
    Stable recursive procedures for numerical computations in markov models (1987)
    Springer
    Annals of operations research 8 (1987), S. 27-40 
    Details
    ISSN: 1572-9338
    Keywords: Markov processes ; numerical methods ; left-skip-free transitions ; Markov decision processes ; queues
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Recursive methods have been proposed for the numerical solution of equations arising in the analysis and control of Markov processes. Two examples are (i) solving for the equilibrium probabilities, and (ii) solving for the minimal expected cost or time to reach state zero, in a Markov process with left-skip-free transition structure. We discuss conditions under which recursive techniques are numerically stable and efficient, giving applications to descriptive and control models for queues.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187080
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Asymptotic marginal independence in large networks of loss systems (1987)
    Springer
    Annals of operations research 8 (1987), S. 57-73 
    Details
    ISSN: 1572-9338
    Keywords: Approximations ; product-form solutions ; limit theorems
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract Network models in which each node is a loss system frequently arise in telephony. Models with several hundred nodes are common. Suppose a customer requires a server from each of several nodes. It would be convenient if the probability that the required servers are all free were approximately a product, where each term is the probability a required node has a free server. We present some theorems to support this approximation. Most of the theorems are restricted to nodes with one server. Some of the difficulties in analyzing nodes with multiple servers are described.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187082
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 3
    Electronic Resource
    Electronic Resource
    Decomposition approximation of queueing-network control models with tree structures (1987)
    Springer
    Annals of operations research 8 (1987), S. 117-132 
    Details
    ISSN: 1572-9338
    Keywords: Control of queueing networks ; decomposition ; Markov decision processes
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract We devise a decomposition approximation method for a general branching queueing network with service-rate controls. The decomposition method, which reduces and simplifies computation routines considerably, results from the conditions for monotone optimal control policies in induction arguments. We first isolate each branch of connected queues as a subnetwork and then link the subnetworks through branching nodes to approximate the optimal control policies for the global network. The numerical results for a wide class of cost models show that the approximated optimal policies from the decomposed problems are sufficiently close to the optimal policies of the global problem.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF02187086
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...