2957 search results - page 432 / 592 » The Complexity of Polynomial-Time Approximation |
165
click to vote
CCGRID
2002
IEEE
15 years 11 months ago
2002
IEEE
A scalable and expressive peer-to-peer (P2P) networking and computing framework requires efficient resource discovery services. Here we propose NEVRLATE, for Network-Efficient V...
197
click to vote
IEEEMSP
2002
IEEE
15 years 11 months ago
2002
IEEE
—This paper presents an operational rate-distortion (ORD) optimal approach for skeleton-based boundary encoding. The boundary information is first decomposed into skeleton and di...
149
click to vote
CDC
2009
IEEE
15 years 11 months ago
2009
IEEE
Abstract— Power dissipation has constrained the performance boosting of modern computer systems in the past decade. Dynamic power management (DPM) has been implemented in many sy...
175
click to vote
SARA
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. This article presents two new algorithms whose purpose is to maintain the Max-RPC domain filtering consistency during search with a minimal memory footprint and implemen...
177
click to vote
COCO
2001
Springer
15 years 10 months ago
2001
Springer
Motivated by recent work on quantum black-box query complexity, we consider quantum versions of two wellstudied models of learning Boolean functions: Angluin’s model of exact le...