{"id":"W16126390","doi":"10.1007/978-3-642-37198-1_4","title":"A New Crossover for Solving Constraint Satisfaction Problems","year":2013,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Crossover; Constraint satisfaction problem; Computer science; Heuristic; Constraint satisfaction; Solver; Mathematical optimization; Constraint (computer-aided design); Genetic algorithm; Artificial intelligence; Mathematics; Machine learning","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":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.0004362622,0.0004595026,0.0004124636,0.0006055295,0.0003256099,0.001177125,0.001036945,0.0003353317,0.0002690434],"category_scores_gemma":[0.0001015894,0.0004464166,0.000155454,0.0003424524,0.0003975568,0.001114951,0.0003893943,0.0004928013,0.00007188055],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003844016,"about_ca_system_score_gemma":0.001055849,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001070772,"about_ca_topic_score_gemma":0.0003053221,"domain_scores_codex":[0.9969364,0.00001229948,0.0005568591,0.001279182,0.0006300047,0.0005852717],"domain_scores_gemma":[0.9979085,0.0003805518,0.000364327,0.0007771748,0.0003379011,0.0002314929],"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.000002693084,0.000004633864,0.00006522176,0.00002875753,0.000009322354,0.000002953621,0.0003638103,0.04235451,0.0001687357,0.04112919,0.000149369,0.9157208],"study_design_scores_gemma":[0.0007225908,0.0001451581,0.0006329459,0.0003471632,0.00001048015,0.00009267687,2.645577e-7,0.7940536,0.0004633568,0.1999108,0.00283973,0.0007812017],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000181061,0.0001122338,0.9927349,0.0009512471,0.002181374,0.001102449,0.000006727904,0.000230477,0.002662483],"genre_scores_gemma":[0.04803569,0.00003507268,0.9491625,0.0009820781,0.0004397695,0.00003177947,0.000007773537,0.00003679889,0.001268519],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9149396,"threshold_uncertainty_score":0.9998598,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01715326429431593,"score_gpt":0.2397524808748008,"score_spread":0.2225992165804848,"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."}}