1445 search results - page 75 / 289 » Uniformly Hard Languages |
123
click to vote
IROS
2009
IEEE
15 years 10 months ago
2009
IEEE
—Software development for industrial robots is still strongly limited by the use of old-style robot programming languages. These languages are tailored to meet a special requirem...
120
click to vote
CC
2005
Springer
15 years 9 months ago
2005
Springer
Abstract. Network processors (NPs) typically contain multiple concurrent processing cores. State-of-the-art programming techniques for NPs are invariably low-level, requiring progr...
136
click to vote
ICALP
2010
Springer
15 years 8 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...
106
click to vote
MST
2008
15 years 3 months ago
2008
The Turing and many-one completeness notions for NP have been previously separated under measure, genericity, and bi-immunity hypotheses on NP. The proofs of all these results rel...
131
click to vote
STOC
2003
ACM
16 years 4 months ago
2003
ACM
We describe a simple randomized construction for generating pairs of hash functions h1, h2 from a universe U to ranges V = [m] = {0, 1, . . . , m - 1} and W = [m] so that for ever...