ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
Filter
  • Parallel graph algorithms  (1)
  • confidence intervals  (1)
Collection
Keywords
Publisher
Years
  • 1
    Electronic Resource
    Electronic Resource
    On the application of the Bootstrap to assess the risk of deficient annual inflows to a reservoir (1988)
    Springer
    Water resources management 2 (1988), S. 245-254 
    Details
    ISSN: 1573-1650
    Keywords: Deficient annual inflows ; univariate model selection ; bootstrap ; confidence intervals
    Source: Springer Online Journal Archives 1860-2000
    Topics: Architecture, Civil Engineering, Surveying , Geography
    Notes: Abstract The paper considers the problem of univariate model selection in order to assess the risk of sequences of deficient annual inflow sums to a reservoir. A selection criterion is proposed which emphasises the fit of a model to the lower tail of the empirical distribution function. The expectation of the discrepancy between the operating and approximating models is estimated using the Bootstrap algorithm. The Bootstrap is also used to estimate confidence intervals about an estimated percentile and these are compared to those found using conventional asymptotic estimators. Applications are given for three South African reservoirs.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF00424657
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Greedy partitioned algorithms for the shortest-path problem (1991)
    Springer
    International journal of parallel programming 20 (1991), S. 271-298 
    Details
    ISSN: 1573-7640
    Keywords: Parallel graph algorithms ; concurrent logic programming ; partitioning
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract A partitioned, priority-queue algorithm for solving the single-source best-path problem is defined and evaluated. Finding single-source paths for sparse graphs is notable because of its definitelack of parallelism-no known algorithms are scalable. Qualitatively, we discuss the close relationships between our algorithm and previous work by Quinn, Chikayama, and others. Performance measurements of variations of the algorithm, implemented both in concurrent and imperative programming languages on a shared-memory multiprocessor, are presented. This quantitative analysis of the algorithms provides insights into the tradeoffs between complexity and overhead in graph-searching executed in high-level parallel languages with automatic task scheduling.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01408019
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...