9842 search results - page 547 / 1969 » Compositional timing analysis |
235
click to vote
ECRTS
2006
IEEE
16 years 1 months ago
2006
IEEE
Cache memories have been extensively used to bridge the gap between high speed processors and relatively slower main memories. However, they are sources of predictability problems...
214
click to vote
STACS
2005
Springer
16 years 17 days ago
2005
Springer
Exponential algorithms, i.e. algorithms of complexity O(cn ) for some c > 1, seem to be unavoidable in the case of NP-complete problems (unless P=NP), especially if the problem ...
176
click to vote
RTSS
2000
IEEE
15 years 11 months ago
2000
IEEE
The maturity of schedulabilty analysis techniquesfor fired-prioritypreemptive scheduling has enabled the consideration of timing issues at design time using a specification of the...
180
click to vote
ALMOB
2008
15 years 7 months ago
2008
Background: It is of biological interest to make genome-wide predictions of the locations of DNA melting bubbles using statistical mechanics models. Computationally, this poses th...
180
click to vote
ALMOB
2008
15 years 7 months ago
2008
Background: In recent years, quartet-based phylogeny reconstruction methods have received considerable attentions in the computational biology community. Traditionally, the accura...