human: Given a node-centered hypergraph: <hypergraph>, where nodes represent papers and hyperedges represent groups of papers sharing a common citing paper.

Details of the hypergraph:
Center node: "Evolutionary Neural Networks for Value Ordering in Constraint Satisfaction Problems"
  Abstract: Technical Report AI94-218 May 1994 Abstract A new method for developing good value-ordering strategies in constraint satisfaction search is presented. Using an evolutionary technique called SANE, in which individual neurons evolve to cooperate and form a neural network, problem-specific knowledge can be discovered that results in better value-ordering decisions than those based on problem-general heuristics. A neural network was evolved in a chronological backtrack search to decide the ordering of cars in a resource-limited assembly line. The network required 1/30 of the backtracks of random ordering and 1/3 of the backtracks of the maximization of future options heuristic. The SANE approach should extend well to other domains where heuristic information is either difficult to discover or problem-specific.

Connected through hyperedge HE-1 (induced by source paper "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."):
  with members:
    - "Measuring the Difficulty of Specific Learning Problems"
    - "Trading Spaces: Computation, Representation and the Limits of Uninformed Learning"
    - "Discovering Complex Othello Strategies Through Evolutionary Neural Networks"
    - "USING MARKER-BASED GENETIC ENCODING OF NEURAL NETWORKS TO EVOLVE FINITE-STATE BEHAVIOUR"
    - "Evolving Obstacle Avoidance Behavior in a Robot Arm"
    - "A Comparison of Selection Schemes used in Genetic Algorithms"
    - "Determining Successful Negotiation Strategies: An Evolutionary Approach"
    - "Genetic Programming and Redundancy"

Connected through hyperedge HE-2 (induced by source paper "Learning Sequential Decision Rules Using Simulation Models and Competition"):
  with members:
    - "Machine Learning Learning to Predict by the Methods of Temporal Differences Keywords: Incremental learning, prediction,"
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "The Exploitation of Cooperation in Iterated Prisoner's Dilemma"
    - "USING A GENETIC ALGORITHM TO LEARN BEHAVIORS FOR AUTONOMOUS VEHICLES"
    - "Genetics-based Machine Learning and Behaviour Based Robotics: A New Synthesis complexity grows, the learning task"
    - "Using a Genetic Algorithm to Learn Strategies for Collision Avoidance and Local Navigation"
    - "A Coevolutionary Approach to Learning Sequential Decision Rules"
    - "GENETIC AND NON GENETIC OPERATORS IN ALECSYS"

Connected through hyperedge HE-3 (induced by source paper "Machine Learning,  Efficient Reinforcement Learning through Symbiotic Evolution"):
  with members:
    - "Real-time Interactive Neuro-evolution"
    - "Evolving Obstacle Avoidance Behavior in a Robot Arm"
    - "2-D Pole Balancing with Recurrent Evolutionary Networks"
    - "EVOLVING NEURAL NETWORKS WITH COLLABORATIVE SPECIES"
    - "A Coevolutionary Approach to Learning Sequential Decision Rules"

Question: Please tell me which class the center node belongs to. The 7 classes are: Neural_Networks, Reinforcement_Learning, Probabilistic_Methods, Theory, Genetic_Algorithms, Case_Based, Rule_Learning. Directly output the class name.

gpt: Genetic_Algorithms