{"id":"W2031219522","doi":"10.2991/cse.2013.26","title":"Task Level Parallelization of All Pair Shortest Path Algorithm in OpenMP 3.0","year":2013,"lang":"en","type":"article","venue":"","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Manitoba","funders":"","keywords":"Computer science; Parallel computing; Task (project management); Shortest path problem; Path (computing); Algorithm; Theoretical computer science; Operating system; Graph; Engineering","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.0005125587,0.0005447891,0.0007261989,0.0005182071,0.0007484929,0.0009377059,0.001762178,0.0005613653,0.00417214],"category_scores_gemma":[0.002183101,0.0002547129,0.0006855328,0.0006934396,0.0004651208,0.001046421,0.001225427,0.001122412,0.00102976],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005669844,"about_ca_system_score_gemma":0.001380666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004275727,"about_ca_topic_score_gemma":0.003629383,"domain_scores_codex":[0.9993402,0.0001084267,0.00004508418,0.0001156997,0.000252628,0.000137857],"domain_scores_gemma":[0.9991655,0.0002039468,0.00005115638,0.0002240105,0.0003008968,0.00005457958],"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.0006859868,0.0004003274,0.002944306,0.0005140725,0.0001206387,0.0005086355,0.0005078142,0.6255869,0.03944938,0.07337429,0.02093864,0.234969],"study_design_scores_gemma":[0.00007201873,0.00006281033,0.0004494592,0.000009113345,0.0000130836,0.00009759609,0.00004691204,0.9671662,0.01206291,0.01320911,0.006794365,0.00001637336],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0820981,0.0002229379,0.8904266,0.0002088707,0.0001501418,0.0001709272,0.0003424191,0.007888316,0.01849178],"genre_scores_gemma":[0.3680231,0.0001503014,0.6251876,0.00008269965,0.00003367481,0.0003342907,0.001177653,0.0009179136,0.004092852],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004275727,"threshold_uncertainty_score":0.0139572,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02443955077098859,"score_gpt":0.2332819620227585,"score_spread":0.2088424112517699,"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."}}