### Table 5.1 The impact points amp; the relative errors for the coarser grid (degrees) x(km) y(km) ray?tracer(s) int(s) relative-error

1996

### Table 5.2 The impact points amp; the relative errors for the ner grid (degrees) x(km) y(km) ray?tracer(s) int(s) relative-error

1996

### Table 3: iMax results vs. Max No Hops parameter. Circuit iMax: Max No Hops

1995

"... In PAGE 16: ... We next discuss the e ect of varying the Max No Hops parameter on the performance of iMax. Table3 lists the iMax upper bound results for ISCAS-85 circuits for di erent values of Max No Hops.... ..."

Cited by 36

### Table 2 max z

"... In PAGE 8: ... To begin, the dual of a normal max or min problem can be found by us- ing a tabular approach. Referring to Table2 , if the primal is a normal max problem, it can be read across the rows while the dual is found by reading down the columns. On the other hand, the primal of a normal min prob- lem is read down the columns while the dual is read across the rows [Win94].... In PAGE 9: ...2.1 Dual of Nonnormal Max Problem Using Table2 , the dual of a nonnormal max problem can be read down the columns in the usual fashion. Although this is true, the following modi ca- tions must be made: 1.... ..."

### Table 1. SUM MAX

in The

"... In PAGE 2: ... We also study both symmetric and asymmetric games. Our results (both lower and upper bounds) are summarized in the left part of Table1 . For the case of asymmetric games, the values hold also for network congestion games.... In PAGE 2: ...SUM MAX Symmetric p (p) p (p) Asymmetric p (p) (Np=(p+1)); O(N) Table1 : Price of anarchy of pure equilibria for linear latencies (left) and polynomial latencies of degree p (right). We also extend our results on the average social cost to the case of mixed Nash equilibria (with price of anarchy at most 2:619).... ..."

### Table 1: MAX Problem

1997

"... In PAGE 2: ...ffect of selection. I.e. there can be no introns. 3 GP Parameters Our GP system was set up to be the same as given in [Gathercole and Ross, 1996]. The details are given in Table1 , parameters not shown are as [Koza, 1994, page 655]. On each version of the problem 50 independent runs were conducted (with 6 depths and two types of initialisation in the three bigger problems and 7 tourna- ment sizes this makes a total of 3150 runs).... ..."

Cited by 26

### Table 1: MAX Problem

1999

"... In PAGE 2: ... ect of selection. I.e. there can be no introns. 3 GP Parameters Our GP system was set up to be the same as given in [Gathercole and Ross, 1996]. The details are given in Table1 , parameters not shown are as [Koza, 1994, page 655]. On each version of the problem 50 independent runs were conducted (with 6 depths and two types of initialisation in the three bigger problems and 7 tourna- ment sizes this makes a total of 3150 runs).... ..."

Cited by 19

### Table 3: Average training epochs, (a) 9 train cases. (b) 16 train cases.

in Variations on the Cascade-Correlation Learning Architecture for Fast Convergence in Robot Control

1992

"... In PAGE 8: ...idden units. Finally with a test set of 25 points, an error tolerance of 0.012 length units was achieved with 9 hidden units. Corrective Network Table3 presents the average in training epochs and number of hidden units for different... ..."

Cited by 7