{"id":"W2001287969","doi":"10.1145/2001576.2001648","title":"An efficient hierarchical parallel genetic algorithm for graph coloring problem","year":2011,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":31,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Graph coloring; Computer science; Algorithm; Graph; Parallel computing; Theoretical computer science","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.001965743,0.0001326504,0.0002144285,0.0002906618,0.000359119,0.00014896,0.0006729228,0.00008121432,0.0003650749],"category_scores_gemma":[0.0003339484,0.00009286804,0.0001623113,0.0006283757,0.0001309897,0.0001164506,0.00005833216,0.000119014,0.0002427271],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001368375,"about_ca_system_score_gemma":0.00008019857,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00008012343,"about_ca_topic_score_gemma":0.000016076,"domain_scores_codex":[0.9977506,0.0001077884,0.0004971986,0.0005678195,0.0006234234,0.0004531557],"domain_scores_gemma":[0.9982885,0.0005082936,0.00009336954,0.0005613834,0.000282107,0.0002663326],"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.0001691824,0.002432195,0.006728495,0.00001010115,0.0001387995,0.000019564,0.00487066,0.07045781,0.0004646501,0.1750677,0.003166916,0.736474],"study_design_scores_gemma":[0.0007525785,0.0004431885,0.01447531,0.000007062674,0.00003297891,0.0000153355,0.0004071137,0.8007578,0.0004006746,0.1797369,0.002679215,0.0002918446],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.07331515,0.0000606582,0.9210476,0.0001115303,0.0003060357,0.0003482926,0.0000107993,0.0001368496,0.00466314],"genre_scores_gemma":[0.3123881,0.00000200013,0.6865918,0.0000770343,0.00007216671,0.00007678864,0.000001977157,0.000009973911,0.0007801817],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7361822,"threshold_uncertainty_score":0.3997314,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1618702945412034,"score_gpt":0.3731997507457475,"score_spread":0.2113294562045441,"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."}}