1055 search results - page 128 / 211 » order 2002 |
144
Voted
STOC
2002
ACM
16 years 5 months ago
2002
ACM
We consider the problem of estimating the tour length and finding approximation algorithms for the asymmetric traveling salesman problem arising from the disk scheduling problem. ...
126
click to vote
STOC
2002
ACM
16 years 5 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...
155
click to vote
OSDI
2002
ACM
16 years 5 months ago
2002
ACM
Many distributed applications can make use of large background transfers ? transfers of data that humans are not waiting for ? to improve availability, reliability, latency or con...
154
click to vote
SIGMOD
2002
ACM
16 years 5 months ago
2002
ACM
In environments where exact synchronization between source data objects and cached copies is not achievable due to bandwidth or other resource constraints, stale (out-of-date) cop...
166
click to vote
PODS
2002
ACM
16 years 5 months ago
2002
ACM
Research on information extraction from Web pages (wrapping) has seen much activity in recent times (particularly systems implementations), but little work has been done on formal...