Browse Papers
From IFORS
Contact Us
English
Remember me
Login
Forgot password?
Country: United States
Found
17049 papers
in total
Date Descending
Date Ascending
Title Descending
Title Ascending
Primal–dual strategy for constrained optimal control problems
1999,
Ito K.
An algorithm for efficient solution of control constrained optimal control problems is...
Maintenance-free operating periods – the designer's challenge
1999,
Relf M.N.
It is generally accepted that a major hurt for the aerospace industry is the need for...
Reliability growth – a new graphical model
1999,
Donovan J.
A new reliability growth model is presented which is simpler to plot and fits the data...
Tool replacement policy for probabilistic tool life and random wear process
1999,
Jeang A.
This study presents a tool replacement model which determines the optimal initial tool...
Reliability optimization of complex systems using modified random-to-pattern search algorithm
1999,
Murty B.S.N.
The modified random-to-pattern search (MRPS) algorithm, developed by the authors for...
Reliability assessment of aerospace electronic equipment
1999,
Condra L.
Reliability assessment has been discussed extensively in the commercial aerospace and...
Bargaining with offer dependent break-down probabilities
1998,
Szidarovszky F.
This paper examines a new general version of the alternating offer method, when the...
A new characterization of the non-symmetric Nash solution
1999,
Szidarovszky F.
A one-step stochastic bargaining procedure is examined which is based on assuming...
Rational behaviour and cooperation degree in competitive situations
1999,
Xu C.H.
Decision makers in competitive situations care not only about their own interests but...
Almost stationary epsilon-equilibria in zero-sum stochastic games
2000,
Vrieze O.J.
We show the existence of almost stationary epsilon-equilibria, for all epsilon > 0,...
Stochastic shortest path games
1999,
Bertsekas D.P.
We consider dynamic, two-player, zero-sum games where the ‘minimizing’...
Concatenation-based greedy heuristics for the Euclidean Steiner tree problem
1999,
Zachariasen M.
We present a class of O (n log n) heuristics for the Steiner tree problem in the...
Optimization of control parameters in genetic algorithms: a stochastic approach
1999,
Cao Y.J.
This paper proposes a stochastic approach for optimization of control parameters...
On pattern frequency occurrences in a Markovian sequence
1998,
Regnier M.
Consider a given pattern H and a random text T generated by a Markovian source. We...
Asymptotic mean and variance of electric power generation system production costs via recursive computation of the fundamental matrix of a Markov chain
1999,
Mazumdar Mainak
The cost of producing electricity during a given time interval is a random variable...
Analysis of a sampling control scheme for a perishable inventory system
1999,
Perry David
We consider an inventory system in which both the arrival of items and the demand for...
Nonhomogeneous Poisson processes and logconcavity
2000,
Pellerey F.
In this article, we identify conditions under which the epoch times and the...
Asymptotic behavior of a Markovian stochastic algorithm with constant step
1999,
Fort J.C.
We first derive from abstract results on Feller transition kernels that, under some...
Stability of piecewise-deterministic Markov processes
1999,
Dufour F.
In this paper, we study a form of stability for a general family of nondiffusion...
On-line load balancing and network flow
1998,
Phillips S.
In this paper we study two problems that can be viewed as on-line games on a dynamic...
Average-case analysis of priority trees: A structure for priority queue administration
1998,
Panholzer A.
Priority trees (p-trees) are a certain variety of binary trees of size n constructed...
Some conjectured uniformly optimal reliable networks
2000,
Ath Y.
We consider all-terminal reliability, one of the more popular models in the field of...
Maintaining spanning trees of small diameter
1998,
Italiano G.F.
Given a graph G with m edges and n nodes, a spanning tree T of G, and an edge e that...
An O(n log n) average time algorithm for computing the shortest network under a given topology
1999,
Du D.Z.
In 1992 F.K. Hwang and J.F. Weng published an O(n 2 ) time algorithm for computing the...
First Page
356
357
358
359
360
Last Page
Papers per page:
6 Papers
12 Papers
24 Papers
36 Papers
48 Papers