نتایج جستجو برای: expected profile update time

تعداد نتایج: 2309343  

Journal: :Advances in space research : the official journal of the Committee on Space Research 1989
D F Smart M A Shea

A new event-oriented solar proton prediction model has been developed and implemented at the USAF Space Environment forecast facility. This new model generates predicted solar proton time-intensity profiles for a number of user adjustable energy ranges and is also capable of making predictions for the heavy ion flux. The computer program is designed so a forecaster can select inputs based on th...

Journal: :Muller Journal of Medical Sciences and Research 2014

Journal: :Prescriber 2023

Chronotherapy is a promising approach to drug dosing that optimises the timing of administration synchronise with our circadian rhythms. This article discusses how researchers are finding ways utilise chronotherapy's potential increase efficacy and safety various therapies.

2014
Alexandre David Peter Gjøl Jensen Kim G. Larsen Axel Legay Didier Lime Mathias Grund Sørensen Jakob Haahr Taankvist

2000
Ian Andrew Affleck Luis Goddyn

When communication lines in an interconnection network are prone to random transmission failures, the time required to broadcast a message throughout the network from a given source vertex is uncertain. We view this broadcast time in such unreliable networks as a random variable dependent on the strategy employed by individual nodes to inform their neighbours, and we seek to describe those stra...

Journal: :Math. Oper. Res. 2009
Roee Teper

Assume that a decision maker assesses the worth of the lottery Xn for each n. Assume also that for each n, Xn is preferred to Y . Now, consider the situation where Xn converges, in some sense, to the lottery X. If X is preferred to Y , then the preference order is referred to as time continuous (Gilboa [7]). Information consisting of probabilities of some (but maybe not all) events induces an i...

Journal: :SIAM J. Comput. 1987
Yuri Gurevich Saharon Shelah

One way to cope with an NP-hard problem is to find an algorithm that is fact on average with respect to a natural probability distribution on inputs. We consider from that point of view the Hamiltonian Path Problem. Our algorithm for the Hamiltonian Path Problem constructs or establishes the nonexistence of a Hamiltonian path. For a fixed probability p, the expected run-time of our algorithm on...

Journal: :Journal of Transportation Engineering 1999

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید