3032 search results - page 242 / 607 » Complexity of sequences and dynamical systems |
191
click to vote
NIS
1998
15 years 6 months ago
1998
The execution time of a large query depends mainly on the memory utilization which should avoid disk accesses for intermediate results. Poor memory management can hurt performance ...
185
click to vote
ATVA
2007
Springer
16 years 23 days ago
2007
Springer
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
187
click to vote
HPDC
2010
IEEE
15 years 7 months ago
2010
IEEE
Scientists increasingly rely on the execution of workflows in grids to obtain results from complex mixtures of applications. However, the inherently dynamic nature of grid workflo...
186
click to vote
CORR
2004
Springer
15 years 6 months ago
2004
Springer
We present a polymorphic type system for lambda calculus ensuring that welltyped programs can be executed in polynomial time: dual light affine logic (DLAL). DLAL has a simple typ...
236
click to vote
ASPLOS
2012
ACM
14 years 2 months ago
2012
ACM
Despite a burgeoning demand for parallel programs, the tools available to developers working on shared-memory multicore processors have lagged behind. One reason for this is the l...