Journal: INFORMS Journal On Computing

Found 560 papers in total
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...
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...
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...
Ismorphic routing on a toroidal mesh
Ismorphic routing on a toroidal mesh
1996,
We study a routing problem that arises on SIMD parallel architectures whose...
Multicommodity flows in ring networks
Multicommodity flows in ring networks
1996,
In this paper, we consider the problem of multicommodity flows in a ring network....
An improved algorithm for approximating the performance of stochastic flow networks
An improved algorithm for approximating the performance of stochastic flow networks
1996,
A problem encountered in the analysis of communication and other distribution systems...
Access path optimization in relational joins
Access path optimization in relational joins
1995,
The objective of access path optimization in relational joins is to minimize the...
Scheduling periodic tasks with slack
Scheduling periodic tasks with slack
1997,
We consider the problem of nonpreemptively scheduling periodic tasks on a minimum...
Disjoint paths in the plane
Disjoint paths in the plane
1995,
Given n pairs of points in the Euclidean plane, we address the problem of finding...
Optimal resource assignment of preemptive periodic tasks on multiple processors
Optimal resource assignment of preemptive periodic tasks on multiple processors
1997,
In this article we examine the problem of preemptively scheduling periodically...
Application of an annealed neural network to a timetabling problem
Application of an annealed neural network to a timetabling problem
1996,
In this paper, we use an annealed neural network to solve a timetabling problem with...
A self-organizing approach to managerial nonlinear discriminant analysis: A hybrid method of linear discriminant analysis and neural networks
A self-organizing approach to managerial nonlinear discriminant analysis: A hybrid method of linear discriminant analysis and neural networks
1996,
Due to their adaptive nature neural network models are used widely in classification...
On the Laguerre method for numerically inverting Laplace transforms
On the Laguerre method for numerically inverting Laplace transforms
1996,
The Laguerre method for numerically inverting Laplace transforms is an old established...
A stochastic model for performance evaluation of main memory resident database systems
A stochastic model for performance evaluation of main memory resident database systems
1995,
With the rapid evolution in the computer industry where memory chips of increasing...
Parallel search algorithms for discrete optimization problems
Parallel search algorithms for discrete optimization problems
1995,
Discrete optimization problems (DOPs) arise in various applications such as planning,...
Papers per page: