{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.002869782,0.0004154769,0.0003728777,0.00008290134,0.00132661,0.001504216,0.002570319,0.0001044426,0.000003652073],"category_scores_gemma":[0.0001179205,0.0002544203,0.0002076767,0.0006307531,0.0001237815,0.001250063,0.0003105606,0.0004508613,0.00005477674],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001504323,"about_ca_system_score_gemma":0.00019375,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005092931,"about_ca_topic_score_gemma":0.0000151298,"domain_scores_codex":[0.9966363,0.0002125476,0.000763888,0.0008762427,0.0006142441,0.0008967266],"domain_scores_gemma":[0.9974023,0.0007805929,0.000488224,0.001041124,0.0001759102,0.000111869],"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.00001295868,0.00005324617,0.000164734,0.0001799224,0.0001046382,0.000005386979,0.00217493,0.5962647,0.02017962,0.00106801,0.001811907,0.3779799],"study_design_scores_gemma":[0.0004745109,0.00001598345,0.0001449493,0.0001933544,0.00005265134,0.00009568164,0.0002173722,0.9921405,0.0002850328,0.0003945197,0.005603089,0.0003823945],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001945623,0.001668136,0.9530848,0.04002189,0.000224532,0.002415361,0.000001111034,0.0003565242,0.0002819824],"genre_scores_gemma":[0.2475474,0.00001071139,0.7445771,0.005290863,0.0003506941,0.002021851,0.000003382665,0.00005349407,0.0001445353],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.3958757,"threshold_uncertainty_score":0.9999908,"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."}}