human: Given a hyperedge-centered hypergraph: <hypergraph>, where the center hyperedge groups papers that share a common citing paper.

Details of the hypergraph:
Center hyperedge (induced by source paper "Stochastic Hillclimbing as a Baseline Method for Evaluating Genetic Algorithms"):
  Abstract: We investigate the effectiveness of stochastic hillclimbing as a baseline for evaluating the performance of genetic algorithms (GAs) as combinatorial function optimizers. In particular, we address four problems to which GAs have been applied in the literature: the maximum cut problem, Koza's 11-multiplexer problem, MDAP (the Multiprocessor Document Allocation Problem), and the jobshop problem. We demonstrate that simple stochastic hillclimbing methods are able to achieve results comparable or superior to those obtained by the GAs designed to address these four problems. We further illustrate, in the case of the jobshop problem, how insights obtained in the formulation of a stochastic hillclimbing algorithm can lead to improvements in the encoding used by a GA. fl Department of Computer Science, University of California at Berkeley. Supported by a NASA Graduate Fellowship. This paper was written while the author was a visiting researcher at the Ecole Normale Superieure-rue d'Ulm, Groupe de BioInformatique, France. E-mail: juels@cs.berkeley.edu y Department of Mathematics, University of California at Berkeley. Supported by an NDSEG Graduate Fellowship. E-mail: wattenbe@math.berkeley.edu

Includes members:
  Member "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.":
    also connected through other hyperedges:
      - Hyperedge HE-1 (induced by source paper "Evolving Graphs and Networks with Edge Encoding: Preliminary Report")
  Member "Surgery":
    also connected through other hyperedges:
      - Hyperedge HE-2 (induced by source paper "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.")
  Member "An Evolutionary Approach to Combinatorial Optimization Problems":
    also connected through other hyperedges:
      - Hyperedge HE-3 (induced by source paper "4 Implementing Application Specific Routines  Genetic algorithms in search, optimization, and machine learning. Reading, MA: Addison-Wesley.")
  Member "Chapter 4 Empirical comparison of stochastic algorithms Empirical comparison of stochastic algorithms in a graph":
    also connected through other hyperedges:
      (none)

Question: Please tell me which class the citing paper (i.e., the source paper of the center hyperedge) 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