{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003965092,0.0005809256,0.0009121525,0.0006734202,0.001083064,0.001168602,0.001610318,0.0006544309,0.009185271],"category_scores_gemma":[0.0008819208,0.0005488911,0.0009200178,0.000613141,0.0004681486,0.0009338982,0.001386185,0.0009568389,0.002213363],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007846099,"about_ca_system_score_gemma":0.001209777,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005838286,"about_ca_topic_score_gemma":0.01436615,"domain_scores_codex":[0.9996316,0.00006439387,0.00001707414,0.0001064818,0.0001141291,0.00006626988],"domain_scores_gemma":[0.9996867,0.00008089611,0.00001699503,0.0001024734,0.00007791724,0.00003498323],"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.0008490115,0.0003572778,0.001003581,0.0003960232,0.0001690194,0.0003585083,0.0004324105,0.3360439,0.03350347,0.06969433,0.02458722,0.5326053],"study_design_scores_gemma":[0.0000830164,0.0001024444,0.0004510475,0.00003038776,0.00005209058,0.000180961,0.0001097838,0.941025,0.009405954,0.02434146,0.02419072,0.00002721314],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0675645,0.0008151334,0.8611284,0.0005384198,0.0004182801,0.0003421611,0.0003554792,0.006968072,0.06186948],"genre_scores_gemma":[0.2055455,0.0002903156,0.7603347,0.0001840102,0.00006814126,0.0001760814,0.0006443326,0.001225341,0.03153158],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.009185271,"threshold_uncertainty_score":0.03072786,"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."}}