R. Hinterding, "Representation, Constraint Satisfaction and the Knapsack Problem," in Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press,  Home/Search   Document Not in Database   Summary   Related Articles   Check

....[5] The smallest unit of information stored in a two state quantum computer is called a quantum bit or qubit [7, 8, 9] A qubit may be in the 1 state, in the 0 state, or in any superposition of the two. The classical representation can be broadly classified as: binary, numeric, and symbolic [10]. QEA uses a new representation that is based on the concept of qubits. QEA with the qubit representation has a better characteristic of diversity than classical approaches, since it can represent superposition of states. Convergence can also be obtained with the qubit representation. As a qubit ....

R. Hinterding, "Representation, Constraint Satisfaction and the Knapsack Problem," in Proceedings of the 1999 Congress on Evolutionary Computation, IEEE Press,

....We present the representation and the proposed algorithm in the following. A. Representation A number of different representations can be used to encode the solutions onto individuals in evolutionary computation. The representations can be classified broadly as: binary, numeric, and symbolic [19]. QEA uses a new representation, called a Q bit, for the probabilistic representation that is based on the concept of qubits, and a Q bit individual as a string of Q bits, which are defined below. Definition 1: A Q bit is defined as the smallest unit of information in QEA, which is defined with a ....

R. Hinterding, "Representation, constraint satisfaction and the knapsack problem," in Proc. 1999.

....1422 quantum state, it collapses to a single state [7] 2.1 Representation It is possible to use a number of different representations to encode the solutions onto chromosomes in evolutionary algorithm. The classical representations can be broadly classified as: binary, numeric, and symbolic [8]. QGA uses a novel representation that is based on the concept of qubits. One qubit is defined with a pair of complex numbers, ### ##,as which is characterized by (1) and (2) And an # qubits representation is defined as # # # # ### # # # # (3) where ##, # ### ## ....

R. Hinterding, "Representation, Constraint Satisfaction and the Knapsack Problem," in Proceedings of the 1999.

....a quantum state, it collapses to a single state [8] 2.1 Representation It is possible to use a number of different representations to encode the solutions onto chromosomes in evolutionary computation. The classical representations can be broadly classified as: binary, numeric, and symbolic [9]. GQA uses a novel representation that is based on the concept of qubits. One qubit is defined with a pair of complex numbers, # ; #,as which is characterized by (1) and (2) And an m qubits representation is defined as # # # # ### # # # # # ; 3) where ##, i ##; ....

R. Hinterding, "Representation, Constraint Satisfaction and the Knapsack Problem," in Proceedings of the 1999.

Online articles have much greater impact   More about CiteSeer.IST   Add search form to your site   Submit documents   Feedback  

CiteSeer.IST - Copyright Penn State and NEC