{"id":"W2073818615","doi":"10.1007/s10489-013-0429-5","title":"A hierarchical parallel genetic approach for the graph coloring problem","year":2013,"lang":"en","type":"article","venue":"Applied Intelligence","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":21,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Crossover; Operator (biology); Constraint satisfaction problem; Graph coloring; Graph; Genetic algorithm; Mathematical optimization; Local consistency; Theoretical computer science; Mathematics; Artificial intelligence","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.000545999,0.0004632661,0.0005218593,0.0008012124,0.0007155447,0.000589486,0.001380976,0.0007688496,0.003268075],"category_scores_gemma":[0.001454012,0.0002954885,0.0006894118,0.00110134,0.0006532385,0.0005683091,0.0007697036,0.0008415198,0.0004115618],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001071443,"about_ca_system_score_gemma":0.002120321,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01270795,"about_ca_topic_score_gemma":0.01633674,"domain_scores_codex":[0.9996837,0.00008882521,0.00001013868,0.00006024147,0.0001090236,0.00004798487],"domain_scores_gemma":[0.9996476,0.0001587978,0.00002633563,0.00004731972,0.00009109804,0.00002893054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003770246,0.000136266,0.0004377891,0.00005944045,0.00002906138,0.00006230648,0.0000702454,0.8657036,0.003720497,0.03065156,0.001623131,0.09746842],"study_design_scores_gemma":[0.00002161686,0.00002650971,0.0001038244,0.000004785732,0.00001211472,0.00001807388,0.00001467987,0.9847705,0.0004476382,0.01346584,0.001109915,0.000004489819],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02045814,0.0001235987,0.9709798,0.0002631966,0.00006272781,0.0001070441,0.0000549773,0.0003486012,0.007601958],"genre_scores_gemma":[0.1799039,0.0001992398,0.8146283,0.0001882782,0.00005726997,0.000221482,0.0001590347,0.0001026091,0.004539865],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01270795,"threshold_uncertainty_score":0.02526796,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1276837091283285,"score_gpt":0.3495534716594417,"score_spread":0.2218697625311132,"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."}}