Go to main menuGo to search engineSkip to content

Object's details: Analysis of networks with time-dependent transition probabilities and messages bypass between the queuing systems

Go to the whole object's collection
Structure
Prace Naukowe Instytutu Matematyki i Informatyki=Scientific Research of the Institute of Mathematics and Computer Science.
See the description of publication group

Description

Object is located in the collections:

Additional information

  • Creation date: 2013-05-16
  • Last modification date: 2020-02-12
  • Content object's number of views: 21
  • You could also download the object's description in these formats:
    RDF
     ;
    OAI-PMH

See also

Non stationary analysis of a quening network with positive and negative messages
Creator:Matalytski Mikhail; Naumenko Victor
Date:2013
Type:czasopismo
Finding expected incomes in hm-network with priority requests and linear time-dependent intensity of their service
Creator:Matalytski Mikhail
Date:2011
Type:artykuł
Contributor:Kiturko Olga; Czhornaja Natalia
Solution of optimal control problem for the three-level hm-network – II
Creator:Matalytski Mikhail
Date:2011
Type:artykuł
Contributor:Kiturko Olga
Time-dependent state probabilities of queueing network with unreliable systems in transient regime
Creator:Matalytski Mikhail; Statkevich Sviataslau
Date:2011
Type:artykuł
Solution of optimal control problem for the three-level hm-network I
Creator:Matalytski Mikhail; Kiturko Olga
Date:2011
Type:artykuł
The asymptotic analysis of the income in closed HM-structure with priority messages
Creator:Matalytski Mikhail; Kiturko Olga
Date:2013
Type:czasopismo

Information on financing

The project is co-financed by the European Union from the European Regional Development Fund under the Regional Operational Program of the Silesian Voivodeship for the years 2014 - 2020 Silesian Digitarium. Digitization and access to the resources of cultural institutions of the Silesian Voivodeship.

Partner1
Partner1
We use files, through the cookie quality improvement layer of our website.For more information, please read the document Privacy Policy