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: "Numerical techniques for efficient sonar bearing and range searching in the near field using genetic algorithms"
  Abstract: This article describes a numerical method that may be used to efficiently locate and track underwater sonar targets in the near-field, with both bearing and range estimation, for the case of very large passive arrays. The approach used has no requirement for a priori knowledge about the source and uses only limited information about the receiver array shape. The role of sensor position uncertainty and the consequence of targets always being in the near-field are analysed and the problems associated with the manipulation of large matrices inherent in conventional eigenvalue type algorithms noted. A simpler numerical approach is then presented which reduces the problem to that of search optimization. When using this method the location of a target corresponds to finding the position of the maximum weighted sum of the output from all sensors. Since this search procedure can be dealt with using modern stochastic optimization methods, such as the genetic algorithm, the operational requirement that an acceptable accuracy be achieved in real time can usually be met. The array studied here consists of 225 elements positioned along a flexible cable towed behind a ship with 3.4m between sensors, giving an effective aperture of 761.6m. For such a long array, the far field assumption used in most beam-forming algorithms is no longer appropriate. The waves emitted by the targets then have to be considered as curved rather than plane. It is shown that, for simulated data, if no significant noise

Connected through hyperedge HE-1 (induced by source paper "Dynamic Hill Climbing: Overcoming the limita- tions of optimization techniques"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."

Connected through hyperedge HE-2 (induced by source paper "A Survey of Evolution Strategies"):
  with members:
    - "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley."
    - "On The State of Evolutionary Computation"
    - "A Stochastic Search Approach to Grammar Induction"
    - "Recombination Operator, its Correlation to the Fitness Landscape and Search Performance"
    - "Evaluating Evolutionary Algorithms"
    - "Optimal Mutation Rates in Genetic Search"
    - "Extended Selection Mechanisms in Genetic Algorithms"
    - "Evolutionary Algorithms: Some Very Old Strategies for Optimization and Adaptation"

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