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
  • Articles  (2)
  • 0–1 programming  (1)
  • correctness
  • 1965-1969  (2)
  • 1969  (2)
  • Mathematics  (2)
  • Energy, Environment Protection, Nuclear Power Engineering
Collection
  • Articles  (2)
Source
Keywords
Publisher
Years
  • 1965-1969  (2)
Year
Topic
  • Mathematics  (2)
  • Energy, Environment Protection, Nuclear Power Engineering
  • 1
    Electronic Resource
    Electronic Resource
    A branch-bound algorithm for a wiring problem (1969)
    Springer
    BIT 9 (1969), S. 133-156 
    Details
    ISSN: 1572-9125
    Keywords: Branch and Bound ; discrete optimization ; 0–1 programming
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01933250
    Location Call Number Expected Availability
    BibTip Others were also interested in ...
    Paper (German National Licenses)
    Fulltext
  • 2
    Electronic Resource
    Electronic Resource
    Programming by action clusters (1969)
    Springer
    BIT 9 (1969), S. 250-258 
    Details
    ISSN: 1572-9125
    Keywords: Programming ; algorithms ; proof ; correctness ; programming language
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: 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.
    Type of Medium: Electronic Resource
    URL: http://dx.doi.org/10.1007/BF01946816
    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...