2957 search results - page 91 / 592 » The Complexity of Polynomial-Time Approximation |
STOC
2002
ACM
14 years 10 months ago
2002
ACM
The notion of efficient computation is usually identified in cryptography and complexity with (strict) probabilistic polynomial time. However, until recently, in order to obtain c...
MOBIHOC
2008
ACM
14 years 9 months ago
2008
ACM
Recently, cooperative communications, in the form of keeping each node with a single antenna and having a node exploit a relay node's antenna, is shown to be a promising appr...
IROS
2007
IEEE
14 years 4 months ago
2007
IEEE
— Motion planning for robotic arms is important for real, physical world applications. The planning for arms with high-degree-of-freedom (DOF) is hard because its search space is...
LICS
2005
IEEE
14 years 3 months ago
2005
IEEE
In recent work Baader has shown that a certain description logic with conjunction, existential quantification and with circular definitions has a polynomial time subsumption pro...
RTSS
2002
IEEE
14 years 3 months ago
2002
IEEE
Feasibility analysis of fixed priority systems has been widely studied in the real-time literature and several acceptance tests have been proposed to guarantee a set of periodic ...