{"id":"W2375987846","doi":"","title":"A Multi-constraint QoS Routing Algorithm with link-Disjoint","year":2008,"lang":"en","type":"article","venue":"Microcomputer applications","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Disjoint sets; Computer network; Multipath routing; Quality of service; Constraint (computer-aided design); Routing (electronic design automation); Latency (audio); Link-state routing protocol; Link (geometry); Distributed computing; Algorithm; Routing protocol; Telecommunications; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00002912086,0.0001898444,0.0001694873,0.00006635206,0.000159863,0.00001970988,0.0002480471,0.00009326384,0.000005912737],"category_scores_gemma":[6.722211e-7,0.0001753967,0.00004397809,0.0003035491,0.0001966473,0.00007485351,0.00007942437,0.0002790904,0.00008500695],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0000664028,"about_ca_system_score_gemma":0.00001336803,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001262418,"about_ca_topic_score_gemma":0.000002304387,"domain_scores_codex":[0.9991122,0.000004641762,0.0002175765,0.0002694966,0.00007494578,0.0003210652],"domain_scores_gemma":[0.999485,0.00005500328,0.00002873332,0.0003169761,0.0000456291,0.00006867658],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000001107658,0.00007261553,0.0001323734,0.00001834967,0.00008618865,0.00002041029,0.0002113559,0.04916741,0.005089244,0.00110651,0.0005257825,0.9435686],"study_design_scores_gemma":[0.001115967,0.00005745313,0.002101763,0.0000903883,0.00003212753,0.0005308242,0.0001119053,0.8304286,0.008169568,0.0006021378,0.1557952,0.000964109],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002676803,0.0001881323,0.994189,0.0001147531,0.00001533332,0.0005429217,0.00001171089,0.001963601,0.0002977857],"genre_scores_gemma":[0.04537008,0.00004160572,0.9538333,0.00005946056,0.0002014675,0.0004064844,0.00001804095,0.00004152027,0.00002808179],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9426045,"threshold_uncertainty_score":0.7152469,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01119279671182653,"score_gpt":0.2086443564667235,"score_spread":0.197451559754897,"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."}}