| Document Date: 2012-09-25 04:51:30
Open Document File Size: 198,58 KBShare Result on Facebook
City Nurnberg / Bertinoro / London / Baltimore / New York / Paris / / Company Oxford University Press / / Country Germany / France / Italy / United Kingdom / / Currency pence / / / Facility University of Edinburgh / / IndustryTerm steadystate solution / large systems / productform solution / fixed point algorithms / product-form solutions / computer systems / form networks / product form solution / iterative algorithm / closed queueing networks / feasible solution / simulation tool / communication systems / product-form solution / approximate solution / symbolic solutions / Ad-hoc algorithms / software components / concerns decomposition algorithms / non-liner systems / numerical algorithm / matrix geometric solution / matrix product operator / correct solution / convolution algorithm / software architectures / approximate solutions / stochastic networks / logaritmic reduction algorithm / steady state solution / numerical applications / / Organization Department of Computer Science / University of Edinburgh / µ11 µ21 µ12 Service / Oxford University / / Person Andrea Marin Samuel Rota Bul / Marcel Dekker / John Hopkins / / Position author / / ProgrammingLanguage Java / L / / PublishedMedium The Computer Journal / Theoretical Computer Science / / Technology stopping criteria The algorithm / logaritmic reduction algorithm / specific algorithms / fixed point algorithms / INAP algorithm / Java / queueing theory / LGORITHM DEFINITION The algorithm / numerical algorithm / convolution algorithm / Ad-hoc algorithms / iterative algorithm / simulation / concerns decomposition algorithms / Quality of Service / 1 INAP Algorithm / /
SocialTag |
A numerical algorithm for the decomposition of cooperating structured Markov processes Andrea Marin Samuel Rota Bul`o