Results 1 - 10 of 38,185

Table 3: The parameters for the encoder problem.

in Discovery of Neural Network Learning Rules Using Genetic Programming
by Amr Mohamed Radi, Riccardo Poli 1998
Cited by 1

Table A.1: Settings for all binary encoded problems

in Self–Adaptation in Evolutionary Algorithms Revisited
by James Mcknight, Stoddart Mckenzie

Table 2 Number of cycles for several encoders with given maximal error = 0:1. learning procedure Encoder Problem

in Accelerating Backpropagation through Dynamic Self-Adaptation
by Ralf Salomon Institute, Ralf Salomon, J. Leo Van Hemmen 1996
Cited by 16

Table 3 Number of cycles for several encoders with given maximal error = 0:001. learning procedure Encoder Problem

in Accelerating Backpropagation through Dynamic Self-Adaptation
by Ralf Salomon Institute, Ralf Salomon, J. Leo Van Hemmen 1996
Cited by 16

Table 2 Number of cycles for several encoders with given maximal error = 0:1. learning procedure Encoder Problem

in Accelerating Backpropagation through Dynamic Self-Adaptation
by Ralf Salomon, J. Leo Van Hemmen 1996
Cited by 16

Table 3 Number of cycles for several encoders with given maximal error = 0:001. learning procedure Encoder Problem

in Accelerating Backpropagation through Dynamic Self-Adaptation
by Ralf Salomon, J. Leo Van Hemmen 1996
Cited by 16

Table 1. Encoding the Logistics problem 1-01 with 42 bits.

in Exhibiting Knowledge in Planning Problems to Minimize State Encoding Length
by Stefan Edelkamp, Malte Helmert 1999
"... In PAGE 9: ... This leads to an encoding of 42 bits (cf. Table1 ), which is the output of our algorithm. However, there are cases in which it is not obvious how the problem should be encoded.... In PAGE 10: ... The problem suite consists of six di erent Strips domains, namely Movie, Gripper, Logistics, Mys- tery, Mprime, and Grid. In Table1 we have exemplarily given the full state description for the rst problem in the Logistics suite. The exhibited knowledge in the encoding can be easily extracted in form of state invariants, e.... ..."
Cited by 38

Table 1. Encoding the Logistics problem 1-01 with 42 bits.

in Exhibiting knowledge in planning problems to minimize state encoding length
by Stefan Edelkamp, Malte Helmert 1999
"... In PAGE 9: ... This leads to an encoding of 42 bits (cf. Table1 ), which is the output of our algorithm. However, there are cases in which it is not obvious how the problem should be encoded.... In PAGE 10: ... The problem suite consists of six di erent Strips domains, namely Movie, Gripper, Logistics, Mys- tery, Mprime, and Grid. In Table1 we have exemplarily given the full state description for the rst problem in the Logistics suite. The exhibited knowledge in the encoding can be easily extracted in form of state invariants, e.... ..."
Cited by 38

TABLE I PERCENTAGE OF BINARY CLAUSES IN SAT-ENCODED PLANNING PROBLEMS

in A Simplifier for Propositional Formulas with Many Binary Clauses
by Ronen I. Brafman

Table 2n3a Scheduling results of the MPEGn2d1 encoder problem.

in Hierarchical Scheduling and Allocation of Multirate Systems on Heterogeneous Multiprocessors
by Yanbing Li, Wayne Wolf 1997
"... In PAGE 5: ... a b c d e f x y z root root 5 44 42 6664 3 5 9 3 7 7 9 99 Periodic Task 1: period = 50 Periodic Task 2: period = 25 Process name Execution time Amout of data transfer Figure 9n3a An example used in by Ramamritham in n5b4n5dn3a task graph of two periodic tasks. Table2 shows the scheduling result of the MPEGn2d1 encoding algorithm on 4 identical PEs of 150 MHzn2c based on the characteristics in Table 1. We connected the four PEs by a common bus.... ..."
Cited by 9
Results 1 - 10 of 38,185