Results 1 - 10 of 12,458

Table VI. Variables in the the expanded graph for recursive MSK concatenated with a LDPCC

in unknown title
by unknown authors 2001
Cited by 3

Table 1. FEHN array representation of fully-expanded gene graph for fan-in of 2 and depth 4.

in Genetically Programmed Learning Classifier System Description and Results
by Gregory A. Harrison, Eric W. Worden
"... In PAGE 6: ... The maximums are used, although not all nodes have this maximum fan in, nor do all graphs have the max depth. The structure of the gene graph of Figure 5 allows the node names to be organized into the structure of Table1 , where the contents represent functions or terminals. Thus, all gene graphs complying with the fan in and depth specifications can be represented and compared in one common foundation.... In PAGE 7: ...86 216.42 Another test, to determine the appropriate number of classifiers to use for these sample problems is given in Table1 . This shows that the number of classifiers is relatively important in the speed of learning, although, it will learn satisfactorily without having an optimum number of classifiers.... ..."

Table 1: The number of time-steps that the planning graph was expanded in the single and multi-agent cases.

in An Investigation into Team-Based Planning
by D. Kalofonos, et al.
"... In PAGE 4: ... 3.2 GraphPlan Implementation Table1 shows the time-steps that the planning graph was expanded in each of our experiments. We observe that as the degree of parallelism that the agents explore increases, we obtain sorter plans.... ..."

Table 11: Number of expanded nodes and solution lengths in the optical tele- graph problem for di erent heuristic search algorithms.

in Protocol Verification with Heuristic Search: First Results
by Stefan Edelkamp, Alberto Lluch Lafuente, Stefan Leue 2001
"... In PAGE 17: ... Surprisingly, all -values larger than 3 result in the same number of expansion and solution length. Table11 shows the e ect of di erent heurisic search algorithms in this do- main (with h2 and = 1). We used the same memory sizes as in the dining philosophers example.... ..."
Cited by 17

Table 1: Maximum fraction of bits correctable for each of 100 error patterns, using probabilistic decoding. In each ex- periment, the edge-vertex graph of an algebraic expander was compared against random edge-vertex and bipartite graphs of equivalent size.

in Probabilistic Decoding of Low-Density Cayley Codes
by Adam L. Berger , John D. Lafferty
"... In PAGE 4: ... To address this question, we carried out some preliminary experiments comparing the random and algebraic constructions of (2; d)-regular graphs with parity-check subcodes. Table1 presents some representa- tive results from these experiments.... ..."

Table 5: Graph parameters for the realistic models, applied to the same input timetable G-long-1: The number of nodes and edges of the graphs in the time-expanded (upper part) and time-dependent (lower part) approach, compared to the simplifled, original models.

in Experimental Comparison of Shortest Path Approaches for Timetable Information
by Evangelia Pyrga, Frank Schulz, Dorothea Wagner, Christos Zaroliagis
"... In PAGE 9: ...orld and random queries described in Section 6.1.1. Table5 shows the parameters of the graphs used in the realistic models compared to the original models. 6.... ..."

Table 2 shows the transitions of the speci cation with the trigger events expanded in predicate form, numbered P1 through P12. Figure 5 shows the speci cation graph, with edges labeled by the predicate numbers.

in Generating test data from state-based specifications
by Jeff Offutt, Shaoying Liu, Aynur Abdurazik, Paul Ammann 2003
"... In PAGE 16: ...INACTIVE :Activate ^ Ignited^ Running ^:Brake ^ Activate0 CRUISE P4 CRUISE Ignited^:Ignited0 OFF P5 CRUISE Running ^ Ignited^:Running0 INACTIVE P6 CRUISE :T oofast ^ Ignited^ T oofast0 INACTIVE P7 CRUISE :Brake ^ Ignited^ Running ^:T oofast ^ Brake0 OVERRIDE P8 CRUISE :Deactivate ^ Ignited^ Running ^:T oofast ^ Deactivate0 OVERRIDE P9 OVERRIDE Ignited^:Ignited0 OFF P10 OVERRIDE Running ^ Ignited^:Running0 INACTIVE P11 OVERRIDE :Activate ^ Ignited^ Running ^:Brake ^ Activate0 CRUISE P12 OVERRIDE :Resume ^ Ignited^ Running ^:Brake ^ Resume0 CRUISE Table2 : Expanded Cruise Control Speci cation Predicates 4.2 Test Generation The full predicate, transition, and transition-pair tests were generated by SpecTest.... In PAGE 21: ... (P5 OR P6) : P3 3. (P7 OR P8) : (P11 OR P12) These ordered pairs are transformed into predicates from Table2 . The \OR quot; entries result from the transitions that have two conditions; either condition could be satis ed to take that transition.... ..."
Cited by 23

Table 3: Number of expanded nodes and solution

in Protocol verification with heuristic search
by Stefan Edelkamp, Alberto Lluch Lafuente, Stefan Leue 2001
"... In PAGE 7: ...Table3 refers to experiments with the optical tele- graph protocol and includes experimental results with best- rst search (BF). The breadth- rst search algo- rithm achieves optimal solutions, but it is unable to solve instances with more than 6 stations.... ..."
Cited by 2

Table 3: Number of expanded nodes and solution

in Protocol Verification with Heuristic Search
by Stefan Edelkamp, Alberto Lluch Lafuente, Stefan Leue 2001
"... In PAGE 7: ...Table3 refers to experiments with the optical tele- graph protocol and includes experimental results with best-n0crst search n28BFn29. The breadth-n0crst search algo- rithm achieves optimal solutions, but it is unable to solve instances with more than 6 stations.... ..."
Cited by 3

Table 3: Event Types and Corresponding Hermes Statements To determine the set of all possible execution histories, the rst statement in the ow graph, Start, is matched against the rst event in the event trace, DBG START. Then, the execution history is expanded by checking the successors of the current node in the control ow graph that matches the next entry in the event trace. This process continues until the last event, DBG EXIT, is matched against the statement Stop. If this process terminates successfully, 20

in An Event Abstraction Tool: Theory, Design, and Results
by Thomas Kunz 1994
"... In PAGE 21: ... To create execution histories for each application process, a match has to be de ned between event types and source statements. Table3 lists some of these matches. An event of type DBG CALL, for example, is created every time a call statement is executed.... ..."
Cited by 1
Results 1 - 10 of 12,458