Found 97029 papers in total
Graphs and automata in the theory of signature analysis
1990,
Signature analysis is a compact method in digital testing. Applying this method, a test response sequence...
Some remarks on two degrees of asymmetry in the traveling salesman problem
1988,
The quality of a heuristic for the traveling salesman problem is determined by its bound. Heuristics where...
Heuristic algorithms for the quadratic semi-assignment problem
1988,
A particular problem of assigning several activities on a limited number of facilities is considered; each...
Algorithms to solve the orienteering problem: A comparison
1989,
The multiobjective vending problem (MVP) is a generalization of the traveling salesman problem (TSP) where...
An architecture for integrating expert systems
1989,
A conflict resolver is developed for mediating disputes arising among competing expert systems (ESs). The...
A fundamental matrix for regular semi-Markov processes
1989,
The paper extends the concept of the ‘fundamental matrix’ to semi-Markov processes and derives...
The supercritical birth, death and catastrophe process: Limit theorems on the set of extinction
1989,
The stationary conditional quasi-stationary distribution of the linear birth, death and catastrophe...
Residual risks and hedging strategies in Markovian markets
1989,
The authors prove two explicit formulae for the quadratic residual risk and for the optimal hedging...
Linear programming in vector criterion Markov and semi-Markov decision processes
1989,
Optimality problems in infinite horizon, discrete time, vector criterion Markov and semi-Markov decision...
Forecast horizon in nonstationary Markov decision problems
1989,
The paper extends the concept of decision and forecast horizons from classes of stationary to classes of...
Approximating the Markov property in Markov decision processes
1989,
In many real life situations, random events in one period are correlated with random events in earlier...
Implantation of the matrix product form method for solving the n,p Fork-Join
1989,
In the first section of this paper, the authors present a n,p Fork-Join (multiservor queue with bulk...
Algorithms for proportional matrices in reals and integers
1989,
Let R be the set of nonnegative matrices whose row and column sums fall between specific limits and whose...
A comparison of three algorithms for reducing the profile of a sparse matrix
1989,
First a variant of a well-known algorithm, the Levy algorithm, is described. Then a new algorithm for...
New efficient cluster identification algorithms
1989,
New efficient cluster identification algorithms are presented for binary matrices. The computational time...
Efficient distributed algorithms solving problems about the connectivity of network
1989,
This paper presents new efficient distributed algorithms solving the following problems by using a depth...
New expressions for the extended ℝ-Y reductions
1989,
Reliability-preserving reductions are important for the efficient computation of the K- terminal...
On team strategies for dynamic routing in packet-switching communication networks
1989,
The routing of customers in a network of queues (e.g., packets in a communication network) is considered,...
Implementing Goldber’s max-flow-algorithm-A computational investigation
1989,
This paper reviews Goldberg’s algorithm for solving max-flow-problems on networks and discusses...
Fair allocation on a network
1990,
The adjusted marginal allocation method which was proposed by Claus and Kleitman to allocate costs in a...
The quickest path problem
1990,
Let N be an input network and σ be the amount of data to be transmitted. The quickest path problem...
Computing derivatives in optimisation
1988,
Newton’s method for function minimisation possesses an outstanding property. Its final quadratic...
Convergence of Adomian’s method
1988,
This paper proposes general conditions for proving the convergence of Adomian’s method for the...
Geometrical regularity conditions for variational inequalities
1989,
The authors present a new regularity condition for variational inequalities. This condition is best...
Papers per page:

Paper Filter