Sentence examples for branch procedures from inspiring English sources

And there were clearly gaps in training and communications around these specific branch procedures.

These issues made it clear to us that the language in our branch procedures was not specific enough and left too much room for interpretation from one account to the next.

Obama vetoed the bill last week, arguing that the bill "conflicts with established executive branch procedures and cuts short thorough consideration of issues that could bear on our national interest -- including our security, safety, and environment".

And because this act of Congress conflicts with established executive branch procedures and cuts short thorough consideration of issues that could bear on our national interest -- including our security, safety, and environment -- it has earned my veto".

Regardless of the Nebraska ruling today, the House bill still conflicts with longstanding executive branch procedures regarding the authority of the president and prevents the thorough consideration of complex issues that could bear on U.S. national interests, and if presented to the president, he will veto the bill". .

The first is a branching procedure and the second is a bounding function.

Although a couple of branching methods were tested, the branching procedure stopped before the classification was completed or huge numbers of branches were generated.

If the branching procedure is contrived to complete the classification, the training time will be extremely shorter than that by the GA + SVM method used in this study.

The partition of a set of hyperpaths (widetilde{mathcal {P}}) along a hyperpath (widetilde{pi } in widetilde{mathcal {P}}) is computed by the backwards branching procedure Back-Branch, Algorithm 2.

They proposed a branch-and-bound algorithm that consists of a branching procedure based on the tree enumeration algorithm by Nakano and Uno [29, 30] and bounding operations designed by properties on path frequency and atom-atom bonds.

Given a set S, the branching procedure returns non-overlapping subsets S1, S2,..., whose union is the set S. The bounding function then computes the upper and/or lower bounds of the optimal value given each subset S i.