In this paper, an analytical approach is proposed for planning finger positions of an object with multifingered hand. At first, a method is given to obtain which combination of th...
We give two algorithms for finding all approximate matches of a pattern in a text, where the edit distance between the pattern and the matching text substring is at most k. The fir...
Job-shop scheduling is a classical NP-hard problem. Shmoys, Stein, and Wein presented the first polynomial-time approximation algorithm for this problem that has a good (polylogar...
Leslie Ann Goldberg, Mike Paterson, Aravind Sriniv...
In this paper we study relations which are congruences with respect to and p, where pis the p-cut of the L-fuzzy hyperoperation . The main idea is to start from an equivalence re...
We prove that if two smooth manifolds intersect transversally, then the method of alternating projections converges locally at a linear rate. We bound the speed of convergence in ...