{"id":"W1988189387","doi":"10.1145/1645373.1645374","title":"Shortest paths in time-dependent FIFO networks using edge load forecasts","year":2009,"lang":"en","type":"article","venue":"","topic":"Traffic Prediction and Management Techniques","field":"Engineering","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Time complexity; Node (physics); Polynomial; Function (biology); FIFO (computing and electronics); Enhanced Data Rates for GSM Evolution; Algorithm; Computer science; Arrival time; Binary logarithm; Mathematics; FIFO and LIFO accounting; Combinatorics; Discrete mathematics; Telecommunications","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.001316704,0.00127197,0.001048353,0.001063859,0.0007214387,0.001126901,0.001645634,0.001068274,0.00171788],"category_scores_gemma":[0.006323155,0.0008584044,0.0007647299,0.001571787,0.0007568269,0.003332853,0.0008160283,0.001261302,0.0003097322],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001893994,"about_ca_system_score_gemma":0.001469632,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01188009,"about_ca_topic_score_gemma":0.00979953,"domain_scores_codex":[0.9993017,0.0001450124,0.00004451037,0.0002372905,0.0001439837,0.0001274609],"domain_scores_gemma":[0.996452,0.002720257,0.0003443979,0.0001999236,0.0001725274,0.0001109739],"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.0001848275,0.00002506289,0.0006394997,0.0000660048,0.00002170637,0.00004409978,0.00008040428,0.9692747,0.001310574,0.005978576,0.0005674603,0.02180724],"study_design_scores_gemma":[0.00001222661,0.00001572381,0.0001018528,0.000006127766,0.000005989752,0.00001285691,0.0000173586,0.9902325,0.0005052627,0.008722292,0.000362493,0.000005268479],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07258338,0.0004257955,0.9238356,0.0003172736,0.00005093085,0.00008012074,0.0004405779,0.0008017397,0.001464529],"genre_scores_gemma":[0.6379058,0.0006018826,0.3567021,0.0001173474,0.00006376058,0.0001838666,0.001316783,0.000177962,0.002930559],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01188009,"threshold_uncertainty_score":0.02362192,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.009732687004920844,"score_gpt":0.2114367933383054,"score_spread":0.2017041063333846,"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."}}