{"id":"W2124726667","doi":"10.1109/icccn.1997.623338","title":"Heuristic algorithms for path selection in private ATM networks","year":2002,"lang":"en","type":"article","venue":"","topic":"Network Traffic and Congestion Control","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Dalhousie University","funders":"","keywords":"Shortest path problem; Heuristic; K shortest path routing; Constrained Shortest Path First; Path (computing); Mathematical optimization; Consistent heuristic; Computer science; Longest path problem; Selection (genetic algorithm); Algorithm; Shortest Path Faster Algorithm; Incremental heuristic search; Mathematics; Search algorithm; Theoretical computer science; Artificial intelligence; Graph; Computer network; Beam search","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":[],"consensus_categories":[],"category_scores_codex":[0.0001697922,0.00009924819,0.0001205011,0.00004937627,0.00007423718,0.00008171661,0.0002727327,0.00005959083,0.00004207367],"category_scores_gemma":[0.00001701323,0.00008977685,0.00004371227,0.000353795,0.00001194544,0.0001769747,0.00003249717,0.00009933206,0.00002788339],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003292781,"about_ca_system_score_gemma":0.000006890862,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000005984624,"about_ca_topic_score_gemma":0.0000174919,"domain_scores_codex":[0.9991014,0.00003475961,0.0001851386,0.0002865027,0.0000973353,0.000294834],"domain_scores_gemma":[0.9995995,0.0001251512,0.00004195089,0.000137605,0.00003563165,0.00006021499],"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.000005065014,0.00006873868,0.0005836689,0.000003334284,0.000007714263,0.000004224583,0.00004896793,0.02790283,0.000005370992,0.05813211,0.006151857,0.9070861],"study_design_scores_gemma":[0.0005617393,0.00007927993,0.0008276661,0.000008227525,0.0000027689,0.000006315541,0.000001594428,0.9905813,0.000004398366,0.0009205046,0.006889682,0.0001164731],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001070055,0.0002074619,0.996344,0.0006448567,0.000307281,0.0002651484,2.963532e-7,0.0002232416,0.0009376124],"genre_scores_gemma":[0.9512511,0.00004708754,0.04619531,0.0005166965,0.0002434889,0.00008336762,0.000001015104,0.000007781046,0.001654166],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9626785,"threshold_uncertainty_score":0.3660994,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0177850890709567,"score_gpt":0.2205442733464547,"score_spread":0.2027591842754981,"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."}}