{"id":"W2388273729","doi":"","title":"Research on Shortest Path Parallel Computing Method in Dynamic Routing Optimization","year":2010,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Network Packet Processing and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Shortest path problem; Constrained Shortest Path First; K shortest path routing; Private Network-to-Network Interface; Equal-cost multi-path routing; Routing (electronic design automation); Path (computing); Path vector protocol; Mathematical optimization; Link-state routing protocol; Distributed computing; Routing protocol; Computer network; Theoretical computer science; Mathematics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009883742,0.0008774252,0.0008219414,0.001029205,0.0008687932,0.00110831,0.001120535,0.0006629684,0.002991991],"category_scores_gemma":[0.002230783,0.0003795169,0.0007790375,0.001914793,0.000896036,0.002555258,0.0005866614,0.001717624,0.0005418866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112307,"about_ca_system_score_gemma":0.001483968,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003359576,"about_ca_topic_score_gemma":0.001812852,"domain_scores_codex":[0.9989692,0.000253736,0.00005934023,0.0002033063,0.0004486561,0.00006584483],"domain_scores_gemma":[0.9993136,0.0002573558,0.00003328798,0.00007897812,0.0002857458,0.00003105546],"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.0001276303,0.00009601217,0.001125779,0.0006801015,0.0001540329,0.000144501,0.0001879601,0.3963938,0.009893642,0.2679472,0.006828202,0.3164211],"study_design_scores_gemma":[0.00004283968,0.0001036403,0.0002676413,0.00005320169,0.00005193439,0.0001501535,0.00004830805,0.8700802,0.006457838,0.09706278,0.02563952,0.00004194419],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004182452,0.002851525,0.9852519,0.0004544577,0.0002552119,0.0000392124,0.0000285894,0.0001855149,0.006751224],"genre_scores_gemma":[0.2862996,0.01507085,0.6867899,0.0003385874,0.0007847017,0.000361366,0.0002526282,0.0003433441,0.009758975],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003359576,"threshold_uncertainty_score":0.01000923,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02250664080653481,"score_gpt":0.3586867498326547,"score_spread":0.3361801090261199,"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."}}