Country: United States

Found 17049 papers in total
Stability and chaos in input pricing for a service facility with adaptive customer response to congestion
Stability and chaos in input pricing for a service facility with adaptive customer response to congestion
1998,
We consider the stability of the equilibrium arrival rate and equilibrium admission...
Experience with a cutting plane algorithm for the capacitated spanning tree problem
Experience with a cutting plane algorithm for the capacitated spanning tree problem
1996,
A basic problem in telecommunications network design is that of designing a...
R&D and global manufacturing performance
R&D and global manufacturing performance
1998,
R&D intensity and manufacturing performance were evaluated in this study of 600...
A matching identification problem: A knowledge acquisition approach
A matching identification problem: A knowledge acquisition approach
1995,
The paper is concerned with an identification problem of a set of K out of N numbers....
Quantitative Risk Assessment: A Guide to Monte Carlo Simulation Modeling
Quantitative Risk Assessment: A Guide to Monte Carlo Simulation Modeling
1998,
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
Old Bachelor Acceptance: A new class of non-monotone threshold accepting methods
1995,
Stochastic hill-climbing algorithms, particularly simulated annealing (SA) and...
Tabu thresholding: Improved search by nonmonotonic trajectories
Tabu thresholding: Improved search by nonmonotonic trajectories
1995,
There is an appeal to methods like simulated annealing and threshold acceptance that...
Nortel redefines factory information technology: An OR-driven approach
Nortel redefines factory information technology: An OR-driven approach
1998,
Nortel recruited a team of operations researchers and engineers to develop and...
Boundedness of one-dimensional branching Markov processes
Boundedness of one-dimensional branching Markov processes
1997,
A general model of a branching Markov process on ℝ is considered. Sufficient and...
Comparisons between aggregation/disaggregation and a direct algorithm for computing the stationary probabilities of a Markov chain
Comparisons between aggregation/disaggregation and a direct algorithm for computing the stationary probabilities of a Markov chain
1995,
Aggregation/disaggregation is an iterative scheme that leads to an algorithm for...
A revised stochastic complementation algorithm for nearly completely decomposable Markov chains
A revised stochastic complementation algorithm for nearly completely decomposable Markov chains
1995,
This paper presents a new algorithm which uses stochastic complementation to compute...
Stability of p-persistent CSMA/CD
Stability of p-persistent CSMA/CD
1995,
A semi-Markovian model is developed for slotted p -persistent CSMA/CD with a finite...
On the use of the power series algorithm for general Markov processes, with an application to a Petri net
On the use of the power series algorithm for general Markov processes, with an application to a Petri net
1997,
The power series algorithm has been developed as numerical procedure for solving...
Connected and degraded text recognition using hidden Markov model
Connected and degraded text recognition using hidden Markov model
1994,
We have applied a Hidden Markov Model (HMM) and level-building dynamic programming...
A recursive approach for enumerating minimal cutsets in a network
A recursive approach for enumerating minimal cutsets in a network
1994,
This paper presents a new recursive labeling algorithm for determining all minimal...
Dominant graphs for rectilinear network design with barriers
Dominant graphs for rectilinear network design with barriers
1997,
Given a set of points on a Cartesian plane and the coordinate axes, the rectilinear...
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
Computational experience with an approximation algorithm on large-scale Euclidean matching instances
1996,
We consider a 2-approximation algorithm for Euclidean minimum-cost perfect matching...
Localizing and diagnosing infeasibilities in networks
Localizing and diagnosing infeasibilities in networks
1996,
Network models are among the largest linear programs solved, but formulation can be a...
Capacitated network design—polyhedral structure and computation
Capacitated network design—polyhedral structure and computation
1996,
We study a capacity expansion problem that arises in telecommunication network design....
Methodology for stochastic graph completion-time problems
Methodology for stochastic graph completion-time problems
1996,
Assume a completion time T 0 and a graph having edges with randomly chosen weights are...
Incorporating the major consensus concurrency control mechanism into the database allocation problem
Incorporating the major consensus concurrency control mechanism into the database allocation problem
1995,
The problem of database allocation incorporating a specific concurrency control...
Bottleneck Steiner subnetwork problems with k-connectivity constraints
Bottleneck Steiner subnetwork problems with k-connectivity constraints
1996,
The objective is to connect a given set of terminal nodes of a network by a subnetwork...
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
The smallest networks on which the Ford–Fulkerson maximum flow procedure may fail to terminate
1995,
It is widely known that the Ford–Fulkerson procedure for finding the maximum...
Optimization circuits for the Bellman–Ford computation algorithm
Optimization circuits for the Bellman–Ford computation algorithm
1994,
The Bellman–Ford algorithm is well known for providing a dynamic programming...
Papers per page: