نتایج جستجو برای: discrete time queuing theory
تعداد نتایج: 2619743 فیلتر نتایج به سال:
-The performance in terms of reliability of multi-server computer networks motivates this paper. The probability limit theorem is derived on the virtual waiting time of job in nodes in a multi-server open queueing network and applied to a reliability model for multi-server computer networks where we relate the time of failure of a multi-server computer network to the system parameters. Key-Word...
In this paper, a chattering-free sliding-mode control is mainly proposed in a second-order discrete-time system. For achieving this purpose, firstly, a suitable control law would be derived by using the discrete-time Lyapunov stability theory and the sliding-mode concept. Then the input constraint is taken into account as a saturation function in the proposed control law. In order to guarantee ...
in this paper, a stochastic cell formation problem is studied using queuing theory framework and considering reliability. since cell formation problem is np-hard, two algorithms based on genetic and modified particle swarm optimization (mpso) algorithms are developed to solve the problem. for generating initial solutions in these algorithms, a new heuristic method is developed, which always cre...
this paper presents a new nonlinear mathematical model to solve a cell formation problem which assumes that processing time and inter-arrival time of parts are random variables. in this research, cells are defined as a queue system which will be optimized via queuing theory. in this queue system, each machine is assumed as a server and each part as a customer. the grouping of machines and parts...
The modularity of the Discrete-Time Analysis (DTA) technique calls for a toolkit consisting of all the operators involved in order to easily implement the algorithms on a computer using object-oriented language. This paper presents a toolkit of DTA operators written in the Octave language. The use of the toolkit is demonstrated by the numerical analysis of the discrete-time GI=GI=1 queuing syst...
of dissertation Presented to the Graduate School of the University of Florida in Partial Fulfillment of the Requirements for the Degree of Doctor of Philosophy PARALLEL DISCRETE EVENT SIMULATION OF QUEUING NETWORKS USING GPU-BASED HARDWARE ACCELERATION By Hyungwook Park December 2009 Chair: Paul A. Fishwick Major: Computer Engineering Queuing networks are used widely in computer simulation stud...
The paper is devoted on computer simulation of rare event probability, which is a critical issue in areas such as reliabilities, telecommunications, aircraft management, etc. This means that it is necessary to evaluate probabilityties less than 10, which is unreasonable to be simulated with standard Monte Carlo approach. M/M/1/N queuing system and tandem queuing system are under investigation w...
2 Systems and Models 7 2.1 Classification . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 9 2.2 Input and output representations . . . . . . . . . . . . . . . . . . . . 10 2.2.1 Time Driven Systems . . . . . . . . . . . . . . . . . . . . . . 10 2.2.2 Event Driven Systems . . . . . . . . . . . . . . . . . . . . . 11 2.3 Time . . . . . . . . . . . . . . . . . . . . . . . . . . . . . ....
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید