Results 1 - 10 of 6,459

Table 1. Exits identi ed in the co ee task

in A Causal Approach to Hierarchical Decomposition of Factored MDPs
by Anders Jonsson, Andrew Barto 2005
"... In PAGE 4: ...ng to this change is h(U; R); GOi, i.e., executing GO in a state s whose projection ffU;Rg(s) equals (U; R) causes the value of SW to change from W to W with non-zero probability. Table1 shows a complete list of exits iden- ti ed by VISA in the co ee task. We label each option with the change it causes; for example, W ! W is the option associated with the exit h(U; R); GOi.... ..."
Cited by 5

Table 3. Case Summary

in Comparative Results From a CFD Challenge Over a 2D ThreeElement High-Lift Airfoil
by Steven M. Klausmeyer, John C. Lin 1997
"... In PAGE 4: ... Challenge participants are listed in Table 2 along with code name, legend key, solution scheme, grid type, and turbulence model. The challenge consisted of five computational cases that are list in Table3 . The first three cases were mandatory for each participant and the last two were optional.... ..."
Cited by 1

Table 5: Options for printing. code meaning

in An Interactive Complex Hermitian-Lanczos Eigensolver
by Osni Marques 1994
"... In PAGE 17: ...2.2 Print options The input parameter LPSET(4) is used as a ag for printing information, as indicated in Table5 . Therefore, if one wants to print only the header, the exit values and the eigenvalues, for example, LPSET(4) should be set to 6, i.... ..."
Cited by 4

Table 4: Alternative design predicates for the hypothetical ATM example.

in Automatic Structuring of Embedded Hypermedia Documents
by Stuart Shieber, Rebecca Hwa, Rebecca Hwa, Joe Marks, Joe Marks 1995
"... In PAGE 11: ... However, a di#0Berent set of reasonable design predicates can lead to a very di#0Berent document structure. For instance, starting from the alternative design predicates in Table4 , 22 of 100 runs of the partitioning algorithm generated the solution illustrated in Table 5 and Figures 9 and 10. The document structure is distinguished by its exclusive use of forward links: the user can only move forwards in the document, but not backwards.... ..."
Cited by 1

Table 4: Alternative design predicates for the hypothetical ATM example.

in Automatic structuring of . . .
by Rebecca Hwa, Joe Marks, Stuart Shieber 1995
"... In PAGE 9: ... However, a di#0Berent set of reasonable design predicates can lead to a very di#0Berent document structure. For instance, starting from the alternative design predicates in Table4 , 22 of 100 runs of the partitioning algorithm generated the solution illustrated in Table 5 and Figures 9 and 10. The document structure is distinguished by its exclusive use of forward links: the user can only move forwards in the document, but not backwards.... ..."
Cited by 1

Table 4: Alternative design predicates for the hypothetical ATM example.

in Automatic Structuring of Embedded Hypermedia Documents
by Rebecca Hwa, Joe Marks, Stuart Shieber
"... In PAGE 9: ... However, a di erent set of reasonable design predicates can lead to a very di erent document structure. For instance, starting from the alternative design predicates in Table4 , 22 of 100 runs of the partitioning algorithm generated the solution illustrated in Table 5 and Figures 9 and 10. The document structure is distinguished by its exclusive use of forward links: the user can only move forwards in the document, but not backwards.... ..."

Table 5: The Execution of Constraint Nodes

in Sisl: Several Interfaces, Single Logic
by Thomas Ball, Christopher Colby, Peter Danielsen, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Läufer, Peter Mataga, Kenneth Rehor
"... In PAGE 14: ... An optional finished tuple, consisting of an optional exit action (not involving user interaction), an optional notify function, an optional up-label function, and an optional child node. A detailed description of constraint node execution is given in Table5 , and summarized below. The constraints are evaluated in the specified priority order (currently the total ordered set).... ..."

Table 5: The Execution of Constraint Nodes

in Sisl: Several Interfaces, Single Logic
by Thomas Ball, Christopher Colby, Peter Danielsen, Lalita Jategaonkar Jagadeesan, Radha Jagadeesan, Konstantin Laufer, Peter Mataga, Kenneth Rehor
"... In PAGE 14: ... An optional finished tuple, consisting of an optional exit action (not involving user interaction), an optional notify function, an optional up-label function, and an optional child node. A detailed description of constraint node execution is given in Table5 , and summarized below. The constraints are evaluated in the specified priority order (currently the total ordered set).... ..."

Table 17 - EXIT Codes

in unknown title
by unknown authors 1999
"... In PAGE 42: ... Exit codes indicate the status of a STAPL file that has run to completion, including successful processing of the EXIT statement itself (which terminates the execution of the program). Table17 shows the EXIT codes that are defined. Table 17 - EXIT Codes... ..."

Table 9: Exit Codes

in OTTER3.0 Reference Manual and Guide
by William W. McCune
"... In PAGE 51: ... The codes are useful when another program or system calls Otter. Table9 lists the exit codes. Note that we do not follow the unix convention of returning zero for normal and nonzero for abnormal termination.... ..."
Results 1 - 10 of 6,459