12950 search results - page 564 / 2590 » On Optimal Timed Strategies |
176
click to vote
SODA
2000
ACM
15 years 8 months ago
2000
ACM
We discuss the problem of optimally "finishing" a partially sequenced, reconstructed DNA segment. At first sight, this appears to be computationally hard. We construct a...
211
Voted
FGCS
2008
15 years 6 months ago
2008
In this paper, we describe a Service-Oriented Architecture allowing the optimization of the execution of service workflows. We discuss the advantages of the serviceoriented approa...
203
Voted
ICPADS
2008
IEEE
16 years 1 months ago
2008
IEEE
Existing solutions for top-k queries in wireless sensor networks mainly focused on energy efficiency and little attention has been paid to the response time to answer a top-k que...
159
Voted
ICCAD
2007
IEEE
16 years 4 months ago
2007
IEEE
— We present a new linear time technique to compute criticality information in a timing graph by dividing it into “zones”. Errors in using tightness probabilities for critica...
177
Voted
DSD
2003
IEEE
16 years 17 days ago
2003
IEEE
Cache design for high performance computing requires the realization of two seemingly disjoint goals of higher hit ratios at reduced access times. Recent research advocates the us...