{"id":"W2008126942","doi":"10.1007/s00453-001-0039-1","title":"On-Line Competitive Algorithms for Call Admission in Optical Networks","year":2001,"lang":"en","type":"article","venue":"Algorithmica","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":39,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Theory of computation; Computer science; Logarithm; Network topology; Competitive analysis; Telecommunications network; Line (geometry); Algorithm; Computer network; Mathematics; Upper and lower bounds","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.006013452,0.002006111,0.003477254,0.001833247,0.002369306,0.005152312,0.006273418,0.004763344,0.0135598],"category_scores_gemma":[0.03122453,0.001192543,0.001092988,0.003341496,0.00312435,0.005968346,0.003689088,0.004492057,0.001423825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003949205,"about_ca_system_score_gemma":0.003827746,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007513229,"about_ca_topic_score_gemma":0.006214103,"domain_scores_codex":[0.9951773,0.00244613,0.0001218861,0.0003412627,0.001001222,0.0009121704],"domain_scores_gemma":[0.978152,0.01771007,0.0008738824,0.0009167918,0.001283812,0.001063479],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0008608418,0.0006457979,0.000654057,0.0002201017,0.00007713847,0.00006165066,0.0002352614,0.7999468,0.0007547184,0.09200454,0.01502264,0.08951648],"study_design_scores_gemma":[0.00008281872,0.00005439113,0.00006276312,0.00000847698,0.00001067927,0.00001240116,0.00002722698,0.9600446,0.0001614637,0.03890057,0.000626159,0.000008465307],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.05593266,0.001405298,0.9168251,0.002393844,0.000394307,0.000380532,0.0002419801,0.0008405756,0.02158576],"genre_scores_gemma":[0.7629399,0.001153949,0.2141896,0.000855012,0.0008819048,0.000639444,0.0004518171,0.0004626433,0.01842575],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.0135598,"threshold_uncertainty_score":0.045362,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03568695878688269,"score_gpt":0.311284834257148,"score_spread":0.2755978754702653,"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."}}