ALBERT

All Library Books, journals and Electronic Records Telegrafenberg

X
feed icon rss

Ihre E-Mail wurde erfolgreich gesendet. Bitte prüfen Sie Ihren Maileingang.

Leider ist ein Fehler beim E-Mail-Versand aufgetreten. Bitte versuchen Sie es erneut.

Vorgang fortführen?

Exportieren
Filter
  • Artikel  (4)
  • integration  (2)
  • 0–1 programming  (1)
  • correctness
  • 1965-1969  (4)
  • 1969  (4)
  • Mathematik  (4)
  • Energietechnik
Sammlung
  • Artikel  (4)
Datenquelle
Schlagwörter
Verlag/Herausgeber
Erscheinungszeitraum
  • 1965-1969  (4)
Jahr
Thema
  • Mathematik  (4)
  • Energietechnik
  • 1
    Digitale Medien
    Digitale Medien
    A branch-bound algorithm for a wiring problem (1969)
    Springer
    BIT 9 (1969), S. 133-156 
    Details
    ISSN: 1572-9125
    Schlagwort(e): Branch and Bound ; discrete optimization ; 0–1 programming
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract A simple computational method for solving a specific wiring problem related to the construction of the RC 4000 computer is described. The intimate relationship between the wiring problem and the traveling salesman problem is established, and the algorithm is based upon the “branch and bound” technique as employed by J.D.C. Little et al. [1] for solving the latter problem.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01933250
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 2
    Digitale Medien
    Digitale Medien
    Derivation of explicit expressions for the error terms in the ordinary and the modified Romberg algorithms (1969)
    Springer
    BIT 9 (1969), S. 18-29 
    Details
    ISSN: 1572-9125
    Schlagwort(e): Numerical ; integration ; extrapolation ; error term
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract It is proved that the error terms for both the ordinary and the modified Romberg algorithms may be expressed in terms of Bernoulli polynomials and their related periodic functions. The properties of the error terms may thus be described using the known properties of the Bernoulli polynomials and functions.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01933536
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 3
    Digitale Medien
    Digitale Medien
    Programming by action clusters (1969)
    Springer
    BIT 9 (1969), S. 250-258 
    Details
    ISSN: 1572-9125
    Schlagwort(e): Programming ; algorithms ; proof ; correctness ; programming language
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract The paper describes a programming discipline, aiming at the systematic construction of programs from given global requirements. The crucial step in the approach is the conversion of the global requirements into sets of action clusters (sequences of program statements), which are then used as building blocks for the final program. The relation of the approach to proof techniques and to programming languages is discussed briefly.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01946816
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
  • 4
    Digitale Medien
    Digitale Medien
    On a modification of the Clenshaw-Curtis quadrature formula (1969)
    Springer
    BIT 9 (1969), S. 338-350 
    Details
    ISSN: 1572-9125
    Schlagwort(e): Chebyshev ; approximation ; numerical ; integration
    Quelle: Springer Online Journal Archives 1860-2000
    Thema: Mathematik
    Notizen: Abstract In this paper we discuss a modification of the Clenshaw-Curtis quadrature formula. It is shown that for integrals, where the integrand may be expanded in a sufficiently rapid convergent Chebyshev series, we may split the sequence of calculated approximations into two sequences, one which approximates the integral from above and one which approximates it from below. Thus, at any step during the calculation we obtain both upper and lower bounds for the true value of the integral.
    Materialart: Digitale Medien
    URL: http://dx.doi.org/10.1007/BF01935865
    Standort Signatur Erwartet Verfügbarkeit
    BibTip Andere fanden auch interessant ...
    Artikel (Nationallizenzen)
    Volltext
Schließen ⊗
Diese Webseite nutzt Cookies und das Analyse-Tool Matomo. Weitere Informationen finden Sie hier...