Analytic Hierarchy Model of the Selection of an Optimal Organization Variant
Analýza problémov lokálneho prehľadávania a ich heuristík
Analyzing discrete-time bulk-service Geo/Geob/m queue
This paper analyzes a discrete-time multi-server queue in which service capacity of each server is a minimum of one and a maximum of b customers. The interarrival- and service-times are assumed to be independent and geometrically distributed. The queue is analyzed under the assumptions of early arrival system and late arrival system with delayed access. Besides, obtaining state probabilities at arbitrary and outside observer's observation epochs, some performance measures and waiting-time distribution...
Analyzing linear recursive projects as an absorbing chain.
Analyzing the dynamics of deterministic systems from a hypergraph theoretical point of view
To model the dynamics of discrete deterministic systems, we extend the Petri nets framework by a priority relation between conflicting transitions, which is encoded by orienting the edges of a transition conflict graph. The aim of this paper is to gain some insight into the structure of this conflict graph and to characterize a class of suitable orientations by an analysis in the context of hypergraph theory.
Anmerkungen zu einem Mehrgitterverfahren für lineare Komplementaritätsprobleme.
Annual Preventive Maintenance Scheduling for Thermal Units in an Electric Power System
Another set of verifiable conditions for average Markov decision processes with Borel spaces
In this paper we give a new set of verifiable conditions for the existence of average optimal stationary policies in discrete-time Markov decision processes with Borel spaces and unbounded reward/cost functions. More precisely, we provide another set of conditions, which only consists of a Lyapunov-type condition and the common continuity-compactness conditions. These conditions are imposed on the primitive data of the model of Markov decision processes and thus easy to verify. We also give two...
Ant algorithm for flow assignment in connection-oriented networks
This work introduces ANB (bf Ant Algorithm for bf Non-bf Bifurcated Flows), a novel approach to capacitated static optimization of flows in connection-oriented computer networks. The problem considered arises naturally from several optimization problems that have recently received significant attention. The proposed ANB is an ant algorithm motivated by recent works on the application of the ant algorithm to solving various problems related to computer networks. However, few works concern the use...
Ant Colony Optimisation: models and applications.
Ant Colony Optimization (ACO) is a metaheuristic that is inspired by the shortest path searching behavior of various ant species [1,2]. The initial work of Dorigo, Maniezzo and Colorni [3,4] who proposed the first ACO algorithm called Ant System, has stimulated a still strongly increasing number of researchers to develop more sophisticated and better performing ACO algorithms that are used to successfully solve a large number of hard combinatorial optimization problems such as the traveling salesman...
Ant colony search algorithm for optimal generators startup during power system restoration.
Aplikovaná matematika a doprava
Applicability of an Agent-Based Modeling Concept to Modeling of Transportation Phenomena
Application de la théorie des graphes au choix des investissements à court terme dans un réseau électrique sujet à avaries
Application de l'optimisation en nombres entiers à un problème d'«arrondissage»
Application des lois non paramétriques dans les systèmes d’attente et la théorie de renouvellement
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir : théorie de fiabilité et analyse de survie, files d’attente, maintenance, gestion de stock, théorie de l’économie, L’objet de ce travail est d’utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type et , présentées par Sengupta (1994), pour l’évaluation de certaines caractéristiques....
Application des lois non paramétriques dans les systèmes d'attente et la théorie de renouvellement
Les distributions non paramétriques de survie trouvent, de plus en plus, des applications dans des domaines très variés, à savoir: théorie de fiabilité et analyse de survie, files d'attente, maintenance, gestion de stock, théorie de l'économie, ... L'objet de ce travail est d'utiliser les bornes inférieures et supérieures (en terme de la moyenne) des fonctions de fiabilité appartenant aux classes de distribution de type IFR, DFR, NBU et NWU, présentées par Sengupta (1994), pour l'évaluation de...
Application of a quantitative multiple criteria decision making (MCDM-1) approach to the analysis of investments in construction
Application of Discrete Transforms in Reliability of a Parallel Redundant System.
Application of ELECTRE III and DEA Methods in the Bpr of a Bank Branch Network