We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
The Markov chain approximation method is an effective and widely used approach for computing optimal values and controls for stochastic systems. It was extended to nonlinear (and p...
We present a new method for proving termination of term rewriting systems automatically. It is a generalization of the match bound method for string rewriting. To prove that a term...
Alfons Geser, Dieter Hofbauer, Johannes Waldmann, ...
Constructive methods for matrices of multihomogeneous resultants for unmixed systems have been studied in [7, 14, 16]. We generalize these constructions to mixed systems, whose Ne...
In this paper, we study the number of measurements required to recover a sparse signal in M with L nonzero coefficients from compressed samples in the presence of noise. We conside...