منابع مشابه
Particle Swarm, Optimization technique for stochastic
S. P. Umayal* and N. Kamaraj** *Department of Electrical and Electronic Engg., Sethu Institute of Technology, Virudhunagar **Department of Electrical and Electronic Engg., Thiagarajar College of Engineering, Madurai Tamil Nadu 626 106, India Email: [email protected] (Received on 7 Oct 2006, revised on 26 Feb 2007) ________________________________________________________________________...
متن کاملA Simple Time Scale Decomposition Technique for Stochastic Process Algebras
Many modern computer and communication systems result in large, complex performance models. The compositional approach ooered by stochastic process algebra constructs a model from submodels which are smaller and more easily understood. This gives the model a clear component-based structure. In this paper we present cases when this structure may be used to inform the solution of the model, leadi...
متن کاملStochastic Bandwidth Packing Process: Stability Conditions via Lyapunov Function Technique
We consider the following stochastic bandwidth packing process: the requests for communication bandwidth of different sizes arrive at times t = 0, 1, 2, . . . and are allocated to a communication link using “largest first” rule. Each request takes a unit time to complete. The unallocated requests form queues. Coffman and Stolyar [6] introduced this system and posed the following question: under...
متن کاملStochastic Control Optimization Technique on Multi-server Markovian Queueing System
Queueing network has widely applied to signify and investigate the resource sharing the system such as computer system, communication network. In many applications servers, like Web servers file servers, database servers, a huge amount of transaction has to be handled properly in a specified time limit. Each transaction typically consists of several sub-transactions that have to be processed in...
متن کاملConsidering Stochastic and Combinatorial Optimization
Here, issues connected with characteristic stochastic practices are considered. In the first part, the plausibility of covering the arrangements of an improvement issue on subjective subgraphs is studied. The impulse for this strategy is a state where an advancement issue must be settled as often as possible for discretionary illustrations. Then, a preprocessing stage is considered that would q...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics
سال: 2014
ISSN: 2152-7385,2152-7393
DOI: 10.4236/am.2014.519293