Abstract. We propose an analytic approach to approximate the survival probabilities of schemata under multi-point crossover and obtain its closed form. It gives a convenient way to...
We propose an algorithm for computing an exact absolute factorization of a bivariate polynomial from an approximate one. This algorithm is based on some properties of the algebrai...
The present work is concerned with the uniqueness problem of best simultaneous approximation. An n-dimensional l1- or l-simultaneous unicity space is characterized in terms of Pro...
We consider three variants of the open-end bin packing problem. Such variants of bin packing allow the total size of items packed into a bin to exceed the capacity of a bin, provi...
In this paper, we study the theoretical properties of sparse approximate inverse (SAI) preconditioners. Particularly, we show that for Mmatrices, nonnegativeness is the key to com...