{"id":"W2407981822","doi":"","title":"Stratified sampling for even workload partitioning applied to single source shortest path algorithm","year":2015,"lang":"en","type":"article","venue":"Computer Science and Software Engineering","topic":"Graph Theory and Algorithms","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Alberta","funders":"","keywords":"Computer science; Workload; Shortest path problem; Algorithm; Scheduling (production processes); Parallel computing; Sampling (signal processing); Graph; Graph algorithms; Graph partition; Theoretical computer science; Distributed computing; Mathematical optimization; Mathematics","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.001771682,0.0005122862,0.0006177,0.0006689962,0.0006567164,0.00062008,0.001019943,0.0004387962,0.00152322],"category_scores_gemma":[0.009119034,0.0002954668,0.0004806714,0.0008344678,0.0005628298,0.001018037,0.000910793,0.0007715157,0.0004448394],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007542598,"about_ca_system_score_gemma":0.001630666,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003326333,"about_ca_topic_score_gemma":0.004100786,"domain_scores_codex":[0.9987273,0.0006304455,0.0000644185,0.0001735379,0.0002904961,0.0001138648],"domain_scores_gemma":[0.9965623,0.002101146,0.0001429136,0.0006581935,0.0004269843,0.0001085087],"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.0006727441,0.0002516016,0.005473817,0.0001921795,0.00008232718,0.0002012928,0.0004669917,0.5646757,0.03326429,0.05940676,0.002892761,0.3324196],"study_design_scores_gemma":[0.00001749851,0.00004267774,0.0002518802,0.000003363972,0.000005698625,0.00002090804,0.00001953613,0.9839852,0.003001738,0.01205711,0.0005903987,0.000003966893],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04171022,0.0000834486,0.9562368,0.00008480225,0.00001947164,0.00009576767,0.00003662528,0.0007203573,0.001012587],"genre_scores_gemma":[0.4570547,0.00008315545,0.5414798,0.00007044333,0.00002790993,0.0002680156,0.0002368628,0.0001403965,0.0006386899],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003326333,"threshold_uncertainty_score":0.009369671,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02804920754298108,"score_gpt":0.2293140820036398,"score_spread":0.2012648744606587,"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."}}