2168 search results - page 26 / 434 » Using Approximation Hardness to Achieve Dependable Computati... |
118
click to vote
STOC
2007
ACM
16 years 2 months ago
2007
ACM
In the reordering buffer problem, we are given an input sequence of requests for service each of which corresponds to a point in a metric space. The cost of serving the requests h...
126
Voted
VLSID
2002
IEEE
16 years 2 months ago
2002
IEEE
Among the many techniques for system-level power management, it is not currently possible to guarantee timing constraints and have a comprehensive system model at the same time. S...
116
click to vote
IPSN
2009
Springer
15 years 8 months ago
2009
Springer
In this work we present new in-network techniques for communication efficient approximate query processing in wireless sensornets. We use a model-based approach that constructs a...
135
click to vote
FOCS
1995
IEEE
15 years 5 months ago
1995
IEEE
This paper continues the investigation of the connection between probabilistically checkable proofs PCPs the approximability of NP-optimization problems. The emphasis is on prov...
103
click to vote
IEEEPACT
2002
IEEE
15 years 6 months ago
2002
IEEE
Memory dependence prediction allows out-of-order issue processors to achieve high degrees of instruction level parallelism by issuing load instructions at the earliest time withou...