{"id":"W1560681326","doi":"10.1109/icec.1995.487447","title":"Hybridized crossover-based search techniques for program discovery","year":2002,"lang":"en","type":"article","venue":"","topic":"Evolutionary Algorithms and Applications","field":"Computer Science","cited_by":53,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"Santa Fe Institute","keywords":"Crossover; Hill climbing; Genetic programming; Computer science; Iterated function; Simulated annealing; Iterated local search; Genetic representation; Genetic algorithm; Operator (biology); Mathematical optimization; Theoretical computer science; Algorithm; Artificial intelligence; Local search (optimization); Mathematics; Machine learning; Biology","routes":{"ca_aff":true,"ca_fund":false,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009933425,0.0005860801,0.0008098075,0.001105152,0.0005668771,0.0005704587,0.001367832,0.001199253,0.002940357],"category_scores_gemma":[0.003222631,0.0003118038,0.0008475144,0.001565395,0.001140199,0.0009585543,0.001017628,0.001380762,0.0006438955],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005584547,"about_ca_system_score_gemma":0.000596424,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0008898184,"about_ca_topic_score_gemma":0.001352435,"domain_scores_codex":[0.99926,0.0002331599,0.00002434466,0.0001269378,0.0003075059,0.00004807183],"domain_scores_gemma":[0.9988785,0.0006734261,0.0000703492,0.0001971619,0.0001493682,0.00003121322],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001459918,0.0001869953,0.00133282,0.0002891342,0.0002561377,0.0005561617,0.0004261524,0.3150721,0.0506542,0.1494134,0.003054092,0.4786128],"study_design_scores_gemma":[0.00009680405,0.0003657572,0.0007050094,0.0000446671,0.000158941,0.0008605962,0.00005681489,0.8823093,0.02636282,0.06553416,0.02344956,0.00005555725],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.008315734,0.000326214,0.9868476,0.00009721826,0.00004525076,0.00005723779,0.00001970296,0.0005643783,0.003726842],"genre_scores_gemma":[0.1952303,0.0006781552,0.7986014,0.0001959257,0.00006946041,0.000336217,0.0001227799,0.0001591339,0.004606616],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002940357,"threshold_uncertainty_score":0.009836495,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03403385640385963,"score_gpt":0.3069457912597012,"score_spread":0.2729119348558415,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}