Results 1 - 10 of 17,847

Table 2. NFA semantic operators.

in Evolving graphs and networks with edge encoding: Preliminary report
by Sean Luke 1996
Cited by 29

Table 4. NFA: exact results

in Automata Recognizing No Words: A Statistical Approach
by Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu

Table 2. NFA semantic operators. Operator Children Description

in Evolving Graphs and Networks with Edge Encoding: Preliminary Report
by Sean Luke, Lee Spector 1996
Cited by 29

Table I. Time amp; Space complexities for NFA, DFA automaton

in FIRE/J- Optimizing Regular Expression Searches with Generative Programming
by Vassilios Karakoidas, Diomidis Spinellis

Table 11: Comparative results for NFA NTPS predictor using 13 knots

in Automata Recognizing No Words: A Statistical Approach
by Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu 2004

Table 11. Comparative results for NFA NTPS predictor using 13 knots NFAs % NFAs NTPS

in Automata Recognizing No Words: A Statistical Approach
by Cristian S. Calude, Cezar Câmpeanu, Monica Dumitrescu
"... In PAGE 10: ... Applying the same procedure described for DFAs, but this time for NFAs, we obtain the NTPS predictor a4 for NFA accepting the empty language. Using the first 13 values from Table 10, we obtain the results for the NTPS predictor a4 in Table11 . Using the first 13 values and the supplementary 11 values from Table 10, we get the results in Table 12.... ..."

Table 3: NFA run-time overheads. Absolute overheads indicate execution time in seconds.

in Detecting manipulated remote call streams
by Jonathon T. Giffin, Somesh Jha, Barton P. Miller 2002
"... In PAGE 13: ... The application need not wait for a response, but each call is still an expensive kernel trap and adds to net- work traffic. Table3 shows the additional execution time resulting from operation of models with null calls. Table 4 lists the bandwidth requirements of each inser- tion level for null calls that each consume 100 bytes of bandwidth.... ..."
Cited by 51

Table 4: Null call bandwidth requirements, in Kbps. The programs used NFA models with baseline optimizations.

in Detecting manipulated remote call streams
by Jonathon T. Giffin, Somesh Jha, Barton P. Miller 2002
"... In PAGE 13: ... Table 3 shows the additional execution time resulting from operation of models with null calls. Table4 lists the bandwidth requirements of each inser- tion level for null calls that each consume 100 bytes of bandwidth. We make two primary observations from these results.... ..."
Cited by 51

TABLE II EXPECTEDAND WORST CASE ASYMPTOTICPERFORMANCERATIO OF THE NFa4 ALGORITHM WITH a5 a6 a8 .

in Packet Scheduling with Fragmentation
by Nir Naaman, Raphael Rom

Table 11.2.3 Average values and ranks of NFA/L

in Analysis of bank failure using
by unknown authors
Results 1 - 10 of 17,847