For evaluating decision tables and trees, an algorithm that exploits the hierarchical relationships between the rule conditions may perform better than a simple Rete or sequential algorithm tuned for discrete rules.
12.
On the other hand, many researchers use a pool of processors to speed up the execution of a sequential algorithm, just because independent runs can be made more rapidly by using several processors than by using a single one.
13.
The selection-rejection algorithm developed by Fan et al . in 1962 requires single pass over data; however, it is a sequential algorithm and requires knowledge of total count of items n, which is not available in streaming scenarios.
14.
For example, an algorithm that can be solved in O ( n ) time using the best known sequential algorithm and O \ left ( \ frac { n } { p } \ right ) in a parallel computer with p processors will be considered cost efficient.
15.
However, there are other execution algorithms such as the sequential algorithm ( ILOG and Blaze Advisor terminology ), algorithms for evaluating decision tables / trees, and algorithms tuned for hierarchical XML . The Rete algorithm is a stateful pattern matching algorithm designed to minimize the evaluation of repetitive tests across many objects / attributes and many rules.
16.
An even simpler linear-time sequential algorithm (, Lemma 1 ) does not even need a stack; it assumes that the input sequence is given as an array A [ 1, n ], and stores the index j of the preceding smaller value of the i'th value A [ i ] in P [ i ].
17.
Our article on Biconnected components mentions a " classic sequential algorithm for computing biconnected components in a connected graph due to John Hopcroft and Robert Tarjan ( 1971 ) "-- does anyone what this algorithm is, and if there's a description of it online ? & mdash; Matt Crypto 16 : 42, 14 February 2009 ( UTC)
