### Table 2: Technology Mapping results

"... In PAGE 8: ... The results show that the Boolean approach reduces the number of matching algorithm calls, nd smaller area circuits in better CPU time, and reduces the initial network graph because generic 2-input base function are used. Table2 presents a comparison between SIS and Land for the library 44-2.genlib, which is distributed with the SIS package.... ..."

### Table 4: Henon curve, Swarm improvement

"... In PAGE 4: ... It might be that the swarm had been optimized for the more complex networks. Table4 lists the percentage improvement of the swarm over the plain method. 0.... ..."

Cited by 1

### Table 1. Theories for networks, and their complexities.

"... In PAGE 15: ...1 160.0 Table1 presents six inductive theories that cover the examples. Theory T 1 is the most general theory n3e.... In PAGE 15: ... Finally, theory T 6 concisely expresses the reachability relation using a recursive rule. Table1 also presents the code lengths of the theories, according to the theory complexity measure presented in Section 2.4.... In PAGE 15: ...Thus the prior probability on theories corresponds at least to some extent to our subjective notion of theory simplicity. Note also that the n14 relation on theory complexity connects strongly with the n13 relation on models: for the theories of Table1 wehaveLn28T 1 n29n14Ln28T 4 n29n14Ln28T 6 n29 and Qn28T 1 n29 n13 Qn28T 4 n29 n13 Qn28T 6 n29. Table 2 presents the evaluation of each theory according to the MC and PC measures.... ..."

### Table 1. Parameters of the particle swarms.

### Table 1. Theories for networks, and their complexities. i

1994

"... In PAGE 15: ...1 160.0 Table1 presents six inductive theories that cover the examples. Theory T1 is the most general theory gt;.... In PAGE 15: ... Finally, theory T6 concisely expresses the reachability relation using a recursive rule. Table1 also presents the code lengths of the theories, according to the theory complexity measure presented in Section 2.4.... In PAGE 15: ... Thus the prior probability on theories corresponds at least to some extent to our subjective notion of theory simplicity. Note also that the relation on theory complexity connects strongly with the relation on models: for the theories of Table1 we have L(T1) L(T4) L(T6) and Q(T1) Q(T4) Q(T6). Table 2 presents the evaluation of each theory according to the MC and PC measures.... ..."

Cited by 11

### Table 1. Theories for networks, and their complexities. i

1994

"... In PAGE 15: ...1 160.0 Table1 presents six inductive theories that cover the examples. Theory T1 is the most general theory gt;.... In PAGE 15: ... Finally, theory T6 concisely expresses the reachability relation using a recursive rule. Table1 also presents the code lengths of the theories, according to the theory complexity measure presented in Section 2.4.... In PAGE 15: ... Thus the prior probability on theories corresponds at least to some extent to our subjective notion of theory simplicity. Note also that the relation on theory complexity connects strongly with the relation on models: for the theories of Table1 we have L(T1) L(T4) L(T6) and Q(T1) Q(T4) Q(T6). Table 2 presents the evaluation of each theory according to the MC and PC measures.... ..."

Cited by 11

### Table 4 Classification results with different reducts 1: Number of rules; 2: Classification accuracy POSAR CEAR DISMAR GAAR PSORSAR

"... In PAGE 25: ... So, all the particles have a powerful search capability, which can help the swarm avoid dead ends. The comparison of the number of decision rules and the classification accuracy with different reducts are shown in Table4... ..."