1081 search results - page 18 / 217 » Working with the LR Degrees |
CIE
2006
Springer
14 years 1 months ago
2006
Springer
We work in D[< 0 ]. Given the jump class of any (Turing) degree a, the jump classes of the minimal covers of a is a matter which is entirely settled unless a is high2. We show t...
IMSCCS
2006
IEEE
14 years 3 months ago
2006
IEEE
Slowdown is used to measure the fairness degree of a scheduling algorithm in existing work. However, the fairness degree should be considered within a scheduling algorithm; rather...
COMBINATORICA
2010
13 years 7 months ago
2010
In this paper, we propose a simple and natural randomized algorithm to embed a tree T in a given graph G. The algorithm can be viewed as a "self-avoiding tree-indexed random ...
ICC
2007
IEEE
14 years 4 months ago
2007
IEEE
Abstract— Coverage is a fundamental problem in sensor networks. In this paper, we addressed the coverage problem from two different view points and refer to them as the worst and...
HAPTICS
2008
IEEE
13 years 10 months ago
2008
IEEE
In a telemanipulation system a human operator controls a remotely located teleoperator by a human system interface. In this work the effects of varied human movement control on tas...