Sentence examples for optimal history from inspiring English sources

The main drawback of this algorithm, as mentioned by the authors, is that in order for the prediction methods to be effective, additional exploration is needed to decide on the optimal history length and the sampling rate.

We explored the optimal history length, or number of taps, for the UKF.

Each candidate optimal history is then tested for temporal feasibility, as described in the next section.

Thus, the complexity for returning each optimal history is O(| VG|(hS + k*)).

Note that it is not the case that if one optimal history is infeasible, all optimal histories are infeasible.

Each optimal history is generated by traversing, in pre-order of T G, each unique path that leads to the optimal label(s) in.

Our experiments demonstrate that a fast heuristic can recover optimal histories in a large majority of instances.

It returns the optimal reconciliation score, the values of M ρ g) and corresponding to that score and the number of optimal histories.

However, there may be a large number of optimal and near-optimal histories.

We rewrite the combinatorial problem by encoding it as an instance of the optimal derivation problem on a directed ordered hypergraph that allows us to efficiently count the number of solutions of various costs that are close to the optimal and to compute the probability that any particular interaction gain or loss event is present in the ensemble of near-optimal histories.

Development of intercurrent illness such that at the discretion of the investigator proceeding with chemotherapy or vaccination phases of the protocol would be detrimental; Uncontrolled hypertension despite optimal treatment; History of cardiac disease; History of HIV, HBs antigen, or HCV ; Active clinically serious infections (>grade 2 NCI-CTC version 4.02).