This paper explores a method of manipulating a planar rigid part on a conveyor belt using a robot with just one joint. This approach has the potential of offering a simple and fle...
Srinivas Akella, Wesley H. Huang, Kevin M. Lynch, ...
We present an O(NV +V 3) time algorithm for enumerating all spanning trees of a directed graph. This improves the previous best known bound of O(NE + V + E) [1] when V 2 = o(N), wh...
We introduce a new search problem motivated by computational metrology. The problem is as follows: we would like to locate two unknown numbers x, y [0, 1] with as little uncertain...
Abstract Given k permutations of n elements, a k-tuple of intervals of these permutations consisting of the same set of elements is called a common interval. We present an algorith...