4164 search results - page 809 / 833 » Timing model reduction for hierarchical timing analysis |
105
click to vote
SPAA
2010
ACM
15 years 6 months ago
2010
ACM
In this paper we study a dynamic version of capacity maximization in the physical model of wireless communication. In our model, requests for connections between pairs of points i...
156
click to vote
VLDB
2001
ACM
15 years 6 months ago
2001
ACM
Most modern DBMS optimizers rely upon a cost model to choose the best query execution plan (QEP) for any given query. Cost estimates are heavily dependent upon the optimizer’s e...
136
click to vote
KES
1999
Springer
15 years 6 months ago
1999
Springer
Abstract—Dynamic Demes is a new method for the parallelisation of evolutionary algorithms. It was derived as a combination of two other parallelisation algorithms: the master-sla...
200
click to vote
STOC
1993
ACM
15 years 6 months ago
1993
ACM
Most complexity measures for concurrent algorithms for asynchronous shared-memory architectures focus on process steps and memory consumption. In practice, however, performance of ...
132
click to vote
SIGMETRICS
2010
ACM
15 years 5 months ago
2010
ACM
We define CWS, a non-preemptive scheduling policy for workloads with correlated job sizes. CWS tackles the scheduling problem by inferring the expected sizes of upcoming jobs bas...