Library

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: DFG German National Licenses  (2)
  • 1990-1994  (2)
  • Physical Chemistry  (1)
  • binary trees  (1)
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of optimization theory and applications 74 (1992), S. 259-271 
    ISSN: 1573-2878
    Keywords: Discrete evasion games ; time lags ; value ; binary trees
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics
    Notes: Abstract The discrete evasion game with a three-move lag, formulated over thirty years ago, was one of the earliest games with time-lag complications. This game remains unsolved, even though it is well-known that the game has a value. By considering the bomber-battleship duel and by constructing an explicit strategy for the bomber, we bound the value from below as 0.28648. This is believed to be the best lower bound known.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    New York, NY : Wiley-Blackwell
    International Journal of Chemical Kinetics 22 (1990), S. 633-639 
    ISSN: 0538-8066
    Keywords: Chemistry ; Physical Chemistry
    Source: Wiley InterScience Backfile Collection 1832-2000
    Topics: Chemistry and Pharmacology
    Notes: The reaction rates of SO3 with CH3OH in He were measured at total pressures of 0.7-1.6 torr in flow tubes. The concentration of SO3 was monitored by the SO2* fluorescence from excitation of SO3 at 147 nm. The reaction rate constant of SO3 + CH3OH in the gas phase is determined to be (1.17 ± 0.16) × 10-13 cm3 molec-1 s-1 at room temperature.
    Additional Material: 2 Ill.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...