### Table 1: Model Solution

"... In PAGE 13: ... The price for round-3 trading, P3, reflects the information in both observed order flow and any announcements of intervention. Model Solution Table1 shows the equilibrium trading and pricing rules for each type of intervention we consider. To understand the intuition behind these sets of pricing and trading rules, consider Case 1, where intervention is unannounced and conveys no signal.... ..."

### Table 2: Model solutions

"... In PAGE 10: ... All models had multiple local minima. The number of distinct solutions obtained for these cases are summarized in Table2 . Although some solutions for a particular model have nearly the same objective function value f , the solution vector and set of active constraints are very different, requiring us to treat the solutions as distinct.... In PAGE 11: ...M=3, (cases 1.7, 1.8, and 1.9) of the total 300 random initial points used, only 1 returned the second best f . Mixed discrete problem From the results in Table2 , we can make the following observation: If the two models were further generalized so that NM itself was an additional (discrete) variable able to take value equal to 1, 2 or 3, we see that the optimum value NM is 1 for model 1 and 2 for model 2. Bounded initial point It is interesting to observe the behavior of the two models when starting points were all set to the variable lower bounds.... ..."

### Table 1 Compare: OEHR, original and HL7

"... In PAGE 4: ...The first one, based on absolute original research and modelling approach, the second, by basing the development on the OpenEHR framework and, the third, using the HL7 reference information model and refinement techniques. Table1 presents dimensioning that was considered for comparison. A short explanation of each area and criteria for evaluating follows: - Data Model: RIM from HL7, RM from OEHR and a possible original one.... ..."

### Table 5: Memory requirements for model solution algorithms.

"... In PAGE 30: ... The complexity of Act-Cl2-GSD is O 0 B B B B B B B @ jT j K X k=1 0 B B B B B B B @ Ink?1 1 Rk T k?1 1 T k;T k 1 K X h=k log nh + X e2ES 2 4 k O h=1 Wh(e) ! T k?1 1 T k;T k 1 3 5 log nk jT k 1 j 1 C C C C C C C A 1 C C C C C C C A : 6.7 Comparing the model solution algorithms Table5 summarizes the memory requirements for the solution algorithms we considered, expressed in the units S and D, for a single- or double-precision oating point number (usually 4 and 8 bytes,... ..."

### Table V. Memory Requirements for Model Solution Algorithms

2000

Cited by 52

### Table 2. Model solution for time periods

### Table V. Memory Requirements for Model Solution Algorithms

### Table 18 Solution times for ridler256 model Solution

"... In PAGE 24: ... Recall that the ordered pair (m, n) is a state in the model. As shown by Table18 , this model is one of the toughest to solve in terms of finding a successful method. The expert system recommends BiCGSTAB but this method fails.... In PAGE 24: ... The software automatically switches to Adaptive SOR to obtain the solution. The Expert System line in Table18 shows the iterations and time for BiCGSTAB and Adpative SOR, respectively. This matrix is not NCD; it is too large for the expert system to recommend Gaussian elimination; and it has a very low matrix score (0.... ..."

### Table 21 Solution times for mutex8 model Solution

"... In PAGE 24: ....7. Resource Sharing Model The parameters used for the mutex8 model are shown in Table 19. In Table21 we see results for the case of 16 processes competing to use a resource with capacity Cr = 12. This matrix has 64,839 states and 1,094,983 non-zero elements.... ..."

### Table 1 Benchmark results for the MLLP model. Problem MLLP Model Solution

"... In PAGE 18: ...60 10 15 15 15 7 12 21948 17163 13.69 Table1 shows the results obtained with our MLLP solver . We branch on the piecewise intervals and the production scales simultaneously, selecting vari- ables according to back-propagation-failure and values using triple-on-lp (see Sec.... ..."