Country: France

Found 511 papers in total
Optimal control for a BMAP/SM/1 queue with MAP-input of disasters and two operation modes
2004,
A single-server queueing system with a batch Markovian arrival process (BMAP) and...
Characterization of the departure process from an ME/ME/1 queue
2004,
In this paper we propose a family of finite approximations for the departure process...
Entropy maximization and the busy period of some single-server vacation models
2004,
In this paper, information theoretic methodology for system modeling is applied to...
Maximum likelihood estimates and confidence intervals of an M/M/R/N queue with balking and heterogeneous servers
2004,
This paper considers an M/M/R/N queue with heterogeneous servers in which customers...
Using nonparametric distributions in renewal theory and queue models
2004,
Nonparametric survival distributions find, more and more, applications in a variety of...
Asymptotic differential approximation ratio: Definitions, motivations and application to some combinatorial problems
1999,
We first motivate and define a notion of asymptotic differential approximation ratio....
Modeling and simulation with augmented reality
2004,
In applications such as airport operations, military simulations, and medical...
Crossed clustering: methods and models
1999,
The relations between automatic clustering methods and inferential statistical models...
Spherical dissimilarity indices and normed multidimensional scaling
1999,
Our concern here, is the characterization of dissimilarity indexes defined over finite...
A Markov chain model for traffic equilibrium problems
2002,
We consider a stochastic approach in order to define an equilibrium model for a...
Optimal and near-optimal (s,S) inventory policies for levy demand processes
2001,
A Levy jump process is a continuous-time, real-valued stochastic process which has...
The signed similarities aggregation problem: a fresh look at an old approach
2002,
The signed similarities aggregation problem is solved with a boolean method derived...
Solving the simple plant location problem by genetic algorithm
2001,
The simple plant location problem (SPLP) is considered and a genetic algorithm is...
Bi-directional nearness in a network by analytic hierarchy process and analytic network process
2000,
In this paper we study bi-directional nearness in a network based on AHP (Analytical...
Multicriteria decision models and multivariate models: an application to the transportation of energy
1999,
This paper presents an application of Multiple Attribute Utility Theory on strategic...
The heart and nucleolus of cooperative games
2000,
A cooperative game is defined as a set of players and a cost function. The...
On the strong Berge equilibrium theorem in game theory
2001,
In this paper we study the main properties of the strong Berge equilibrium, then we...
The Lorenz transform approach to the optimal repair-cost limit replacement policy with imperfect repair
2001,
In this paper, we consider a repair-cost limit replacement problem with imperfect...
Comparing classification tree structures: a special case of comparing q-ary relations
1999,
Comparing q-ary relations on a set Q of elementary objects is one of the most...
Resource allocation in a mobile telephone network: A constructive repair algorithm
2001,
To cope with its development, a French operator of mobile telephone network must...
On the parallel complexity of the alternating Hamiltonian cycle problem
1999,
Given a graph with colored edges, a Hamiltonian cycle is called alternating if its...
Structural symmetrics in Petri nets and the reduced reachability graph
2000,
The main purpose of this paper is to give a method for construction of the reduced...
Comparing classification tree structures: a special case of comparing q-ary relations, part II
2000,
Comparing q-ary relations on a set Q of elementary objects is one of the most...
A branch-and-bound method for solving the problem of finding the min cut with size constraint in a graph
2001,
A branch-and-bound method for solving the min cut with size constraint problem is...
Papers per page: