{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001465013,0.001099533,0.001138491,0.001405648,0.0009806224,0.001326402,0.001652399,0.001437768,0.00368082],"category_scores_gemma":[0.003748731,0.0007534957,0.0006023432,0.002012023,0.001205367,0.001636196,0.0009956306,0.0009957848,0.000467607],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001651724,"about_ca_system_score_gemma":0.001623197,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005545886,"about_ca_topic_score_gemma":0.00532005,"domain_scores_codex":[0.9992094,0.0003734119,0.00003367975,0.00009946153,0.0001430549,0.0001408726],"domain_scores_gemma":[0.9978411,0.001667154,0.0001616804,0.0001079782,0.0001462857,0.00007580857],"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.0000813095,0.0000428982,0.0002153112,0.00007050938,0.00003255335,0.00004881248,0.00005669198,0.9280013,0.0003601014,0.01643473,0.00183564,0.05282018],"study_design_scores_gemma":[0.00005746664,0.00002315041,0.00005376286,0.00001164735,0.00001093936,0.00002266461,0.0000249315,0.9752863,0.0002053554,0.02332622,0.0009707063,0.000006872811],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02486079,0.001212514,0.96788,0.0003073716,0.00007804162,0.0001586892,0.0001771399,0.0007358394,0.004589585],"genre_scores_gemma":[0.4100519,0.001148021,0.5841022,0.0001399049,0.00009103507,0.0004875561,0.0005381654,0.0001681262,0.003273149],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005545886,"threshold_uncertainty_score":0.0123136,"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."}}