{"id":"W2400145601","doi":"10.1007/978-3-319-32152-3_17","title":"Parallel Ant Brood Graph Partitioning in Julia","year":2016,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Parallel Computing and Optimization Techniques","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Thread (computing); Graph partition; Parallel computing; Scalability; Parallel algorithm; Algorithm; Theoretical computer science; Graph; Programming language","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"],"consensus_categories":[],"category_scores_codex":[0.001004994,0.0005240038,0.00055696,0.001315194,0.0002391709,0.0004719593,0.00301403,0.0003408614,0.00001810997],"category_scores_gemma":[0.000093164,0.0004485422,0.0001393474,0.0008097184,0.0005007088,0.0006695534,0.001087635,0.0006800292,0.00005437157],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002828906,"about_ca_system_score_gemma":0.0004058407,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001991023,"about_ca_topic_score_gemma":0.00007432464,"domain_scores_codex":[0.9960638,0.00006415245,0.0007022644,0.001582634,0.0007869819,0.0008001609],"domain_scores_gemma":[0.9976537,0.0003769731,0.0003335174,0.001271774,0.0001959788,0.0001680318],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00001304404,0.00008469459,0.0006272022,0.00004990284,0.00001613632,0.0002402255,0.00090219,0.2678708,0.0000820698,0.1597776,0.0002622128,0.570074],"study_design_scores_gemma":[0.0004963296,0.0001620101,0.0003483133,0.001142974,0.000003836897,0.00006057276,7.578926e-8,0.4667267,0.0006180744,0.5278903,0.001604479,0.0009463294],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002581137,0.0004352358,0.9889969,0.001079032,0.0008862315,0.0003279616,0.000002913983,0.0004592201,0.00778666],"genre_scores_gemma":[0.08951689,0.0001912461,0.907795,0.001524014,0.000328152,0.0000221896,0.00000427266,0.00004153772,0.0005766922],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5691276,"threshold_uncertainty_score":0.9997966,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01675300018475794,"score_gpt":0.2498553420978367,"score_spread":0.2331023419130788,"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."}}