All a b c d e f g h i j k l m n o p q r s t u v w x y z Other

Previous Page 5 Next

Displaying 81 – 100 of 884

Showing per page

A discrete-time Geo[X]/G/1 retrial queue with general retrial time and M-additional options for service

Muthukrishnan Senthil Kumar (2011)

RAIRO - Operations Research

This paper concerns a discrete time Geo[X]/G/1 retrial queue with general retrial time in which all the arriving customers require first essential service with probability α 0 while only some of them demand one of other optional services: type − r (r = 1, 2, 3,...M) service with probability α r . The system state distribution, the orbit size and the system size distributions are obtained in terms of generating functions. The stochastic decomposition law holds for the proposed model. Performance measures...

A distributed transportation simplex applied to a Content Distribution Network problem

Rafaelli de C. Coutinho, Lúcia M. A. Drummond, Yuri Frota (2014)

RAIRO - Operations Research - Recherche Opérationnelle

A Content Distribution Network (CDN) can be defined as an overlay system that replicates copies of contents at multiple points of a network, close to the final users, with the objective of improving data access. CDN technology is widely used for the distribution of large-sized contents, like in video streaming. In this paper we address the problem of finding the best server for each customer request in CDNs, in order to minimize the overall cost. We consider the problem as a transportation problem...

A dual approach in fuzzy linear programming.

José M. Cadenas, Fernando Jiménez (1996)

Mathware and Soft Computing

In this paper, we propose a relationship of fuzzy duality. We use the Decomposition Theorem and some properties about Linear Programming with interval coefficients to define this relationship. Thus, a linear programming problem with fuzzy costs represented by membership functions L-R can be solved by means of two dual problems (linear programming problems with fuzzy constraints). Moreover, these results can be applied to multiobjective problems whose coefficients of the objective function are fuzzy...

A factor graph based genetic algorithm

B. Hoda Helmi, Adel T. Rahmani, Martin Pelikan (2014)

International Journal of Applied Mathematics and Computer Science

We propose a new linkage learning genetic algorithm called the Factor Graph based Genetic Algorithm (FGGA). In the FGGA, a factor graph is used to encode the underlying dependencies between variables of the problem. In order to learn the factor graph from a population of potential solutions, a symmetric non-negative matrix factorization is employed to factorize the matrix of pair-wise dependencies. To show the performance of the FGGA, encouraging experimental results on different separable problems...

Currently displaying 81 – 100 of 884