{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0001159251,0.00008098687,0.00008005163,0.00004713214,0.0002096567,0.0002728338,0.0004811801,0.00003015841,0.00003143142],"category_scores_gemma":[0.000009635953,0.00006813576,0.00007948121,0.0002610028,0.00005466142,0.0004909001,0.0000767407,0.00005529844,0.00003001722],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002902264,"about_ca_system_score_gemma":0.00003026654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000155374,"about_ca_topic_score_gemma":0.000001534343,"domain_scores_codex":[0.9991851,0.00001249237,0.0001280916,0.0002849449,0.0001572254,0.0002321421],"domain_scores_gemma":[0.9993523,0.00008823341,0.00002419144,0.0003986749,0.00008249321,0.00005415447],"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.000008964684,0.001363148,0.0001067428,0.00002961729,0.00001412118,0.000002504563,0.00005437013,0.00008207194,0.001943476,0.4298347,0.0390473,0.527513],"study_design_scores_gemma":[0.0004631442,0.0002206561,0.0002133095,0.00000761098,0.000002661954,0.000004500536,0.000004698395,0.8382726,0.02907419,0.006293715,0.1252511,0.0001917796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001018122,0.00004827955,0.988957,0.004367779,0.00003163424,0.0008247438,0.00001125386,0.0007291906,0.004011952],"genre_scores_gemma":[0.1419753,0.0000100775,0.8520889,0.0003437763,0.00007225267,0.0009918053,0.000008399801,0.000007652986,0.004501833],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.8381906,"threshold_uncertainty_score":0.2778496,"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."}}