{"id":"W2072081880","doi":"10.1142/s0129626405002404","title":"Applying the Feedback Guided Dynamic Loop Scheduling Method for the Shortest Path Problem","year":2005,"lang":"en","type":"article","venue":"Parallel Processing Letters","topic":"Real-Time Systems Scheduling","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"St. Francis Xavier University","funders":"","keywords":"Shortest path problem; Dynamic priority scheduling; Computer science; Scheduling (production processes); Loop (graph theory); Mathematical optimization; Fair-share scheduling; Dynamic programming; Feedback loop; Algorithm; Parallel computing; Mathematics; Theoretical computer science; Schedule; Graph","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.000512515,0.0006333843,0.000508991,0.0006234961,0.0005628333,0.0003647399,0.0008566795,0.0005278473,0.003042151],"category_scores_gemma":[0.00155827,0.0001986952,0.0003913426,0.0006491591,0.0005660378,0.0006397485,0.0006877381,0.0008400713,0.0004236131],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005480914,"about_ca_system_score_gemma":0.001066952,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002871909,"about_ca_topic_score_gemma":0.002311253,"domain_scores_codex":[0.9996686,0.00009685506,0.00001198999,0.00005025968,0.0001339495,0.00003834276],"domain_scores_gemma":[0.9995365,0.000247617,0.00003363687,0.00005124023,0.0001049809,0.00002613162],"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.0002410617,0.0001527036,0.0002941254,0.0002193931,0.00004378863,0.0001027645,0.0001634526,0.5168062,0.03345951,0.04475291,0.00421751,0.3995466],"study_design_scores_gemma":[0.0000424833,0.0001105581,0.00007449725,0.000007535825,0.000008148536,0.00003813575,0.00001317268,0.9782568,0.006239009,0.01115134,0.004046937,0.00001132091],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006877865,0.0001112507,0.9905364,0.00005855355,0.00005349415,0.00005354341,0.00002081245,0.0005418758,0.001746309],"genre_scores_gemma":[0.3784074,0.0003436825,0.6173432,0.0001038823,0.00009244731,0.0003218157,0.0001409543,0.0002669774,0.002979662],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003042151,"threshold_uncertainty_score":0.01017702,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02596882797196698,"score_gpt":0.3000389831469986,"score_spread":0.2740701551750316,"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."}}