17329 search results - page 3091 / 3466 » Improved non-approximability results |
172
click to vote
RTA
2005
Springer
16 years 9 days ago
2005
Springer
Proofs of equalities may be built from assumptions using proof rules for reflexivity, symmetry, and transitivity. Reflexivity is an axiom proving x=x for any x; symmetry is a 1-p...
183
click to vote
STACS
2005
Springer
16 years 9 days ago
2005
Springer
Abstract Abstract. Recent work in the analysis of randomized approximation algorithms for NP-hard optimization problems has involved approximating the solution to a problem by the ...
203
click to vote
WINE
2005
Springer
16 years 9 days ago
2005
Springer
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
161
click to vote
ASPLOS
2004
ACM
16 years 7 days ago
2004
ACM
This paper explores a new technique called coherence decoupling, which breaks a traditional cache coherence protocol into two protocols: a Speculative Cache Lookup (SCL) protocol ...
179
click to vote
IUI
2004
ACM
16 years 7 days ago
2004
ACM
As computer applications become larger with every new version, there is a growing need to provide some way for users to manage the interface complexity. There are three different ...