16404 search results - page 799 / 3281 » A set coverage problem |
188
click to vote
DATE
2000
IEEE
15 years 12 months ago
2000
IEEE
We address the problem of inserting repeaters, selected from a library, at feasible locations in a placed and routed network to meet user-specified delay constraints. We use mini...
191
click to vote
DAWAK
1999
Springer
15 years 11 months ago
1999
Springer
A Data Warehouse DW can be abstractly seen as a set of materialized views de ned over relations that are stored in distributed heterogeneous databases. The selection of views for...
206
click to vote
RTSS
1998
IEEE
15 years 11 months ago
1998
IEEE
We propose a unifying method for analysis of scheduling problems in real-time systems. The method is based on ACSR-VP, a real-time process algebra with value-passing capabilities....
218
click to vote
COMPGEOM
1998
ACM
15 years 11 months ago
1998
ACM
Abstract. We propose a simple, general, randomized technique to reduce certain geometric optimization problems to their corresponding decision problems. These reductions increase t...
178
click to vote
STOC
1998
ACM
15 years 11 months ago
1998
ACM
We study integrated prefetching and caching problems following the work of Cao et. al. [3] and Kimbrel and Karlin [13]. Cao et. al. and Kimbrel and Karlin gave approximation algor...