Results 11 - 20 of 132,638

Table 5: Small parameters coming from small symplectic groups

in unknown title
by unknown authors 2008

Table 2: Small 2-closed permutation groups

in Coherent Configurations, Association Schemes and Permutation Groups
by Peter J. Cameron 2003
"... In PAGE 13: ... Since the properties of a permutation group G listed in the theorem depend only on K (G), it suffices to consider 2-closed groups. Table2 gives the num- bers of 2-closed groups of small degree which are respectively 2-transitive, 2- homogeneous, AS-free, primitive, generously transitive, stratifiable, AS-friendly, and transitive. Note that up to degree 30, every AS-free group is 2-homogeneous and every AS-friendly group is stratifiable.... ..."
Cited by 3

TABLE I GROUPS GENERATED BY THE GROUPING ALGORITHM

in A gateway-based defense system for distributed dos attacks in high-speed networks
by Dong Xuan, Shengquan Wang, Ye Zhu, Riccardo Bettati, Wei Zhao 2001
Cited by 2

Table 2: Nonsquarefree orders with small multiplier groups

in The prime power conjecture is true for n < 2,000,000
by Daniel M. Gordon 1994
"... In PAGE 6: ... The orders eliminated in this way are given in Table 1 and 2. Table 1 gives the squarefree orders, and Table2 the nonsquarefree ones. For the latter group, each possible exponent v0 with v jv0jv was tested separately.... ..."

Table 2: Nonsquarefree orders with small multiplier groups

in The Prime Power Conjecture is True for n < 2,000,000
by Daniel M. Gordon 1994
"... In PAGE 4: ...The orders eliminated in this way are given in Table 1 and 2. Table 1 gives the squarefree orders, and Table2 the nonsquarefree ones. For the latter orders, each possible exponent v0 with v jv0jv was tested separately.... ..."
Cited by 3

Table: Full cyclic automorphism groups for small genera

in On Cyclic Groups Of Automorphisms Of Riemann Surfaces
by Emilio Bujalance , Marston Conder 1999
Cited by 3

Table 2: Nonsquarefree orders with small multiplier groups

in The Prime Power Conjecture is True for n < 2,000,000
by Daniel M. Gordon 1994
"... In PAGE 4: ...The orders eliminated in this way are given in Table 1 and 2. Table 1 gives the squarefree orders, and Table2 the nonsquarefree ones. For the latter orders, each possible exponent v0 with v jv0jv was tested separately.... ..."
Cited by 3

Table 1: Squarefree orders with small multiplier groups

in The prime power conjecture is true for n < 2,000,000
by Daniel M. Gordon 1994
"... In PAGE 6: ... If v j 6 lcm(t1 t2; t3 t4), then we have a proof that no di erence set of order n exists. The orders eliminated in this way are given in Table1 and 2. Table 1 gives the squarefree orders, and Table 2 the nonsquarefree ones.... ..."

Table 5 Characteristics of small consumer groups

in A perspective on the restructuring of the Finnish electricity market
by Pierre-olivier Pineau, Raimo P. Haämäläinen

Table 1: Optimality Comparison for Small Instances

in Heuristics for a Brokering Set Packing Problem
by Y. Guo, A. Lim, B. Rodrigues, Y. Zhu 2004
"... In PAGE 5: ...1 Optimality Comparisons of SAG and IG with CPLEX We randomly generated 10 small test cases following the generation mechanism introduced in [5] for which CPLEX can provide optimal results in reasonable time and were able to compare the performance of SAG and IG for small instances. The results are given in Table1 . The time spent on these 10 instances is less than 10 seconds for both SAG and IG methods; and less than 30 seconds for CPLEX.... In PAGE 6: ...Table 2: Experimental Results on Large Instances From Table1 , we see that SAG can find optimal solutions for the 10 small instances, while IG finds 3 out of 10. We can conclude that SAG works better than IG for small size instances.... ..."
Cited by 7
Results 11 - 20 of 132,638