{"id":"W1602326336","doi":"10.1016/j.dam.2003.02.002","title":"Worst-case analysis of a dynamic channel assignment strategy","year":2004,"lang":"en","type":"article","venue":"Discrete Applied Mathematics","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Competitive analysis; Reuse; Channel (broadcasting); Greedy algorithm; Algorithm; Computer science; Online algorithm; Mathematical optimization; Upper and lower bounds; Channel allocation schemes; Mathematics; Theoretical computer science; Computer network; Engineering; Wireless; 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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004679061,0.0001743081,0.0004079422,0.0003570865,0.0001126911,0.0001092544,0.001323325,0.00007614573,0.00001498856],"category_scores_gemma":[0.00001560016,0.000154456,0.0001446924,0.001928376,0.0001004589,0.0001286076,0.0005483896,0.0001896063,0.00002367856],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001125803,"about_ca_system_score_gemma":0.00007726442,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001926622,"about_ca_topic_score_gemma":0.0000478706,"domain_scores_codex":[0.9983392,0.00002481199,0.0004924292,0.0003016941,0.0005174567,0.0003243852],"domain_scores_gemma":[0.9976284,0.0001812062,0.0002558052,0.001735538,0.00007857024,0.0001204626],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000004315344,0.0003192494,0.000001734164,0.00008064151,0.000586266,0.0000504886,0.003105746,0.1202492,0.001382224,0.8681076,0.00001244689,0.006100052],"study_design_scores_gemma":[0.000399576,0.00004015267,0.00008300502,0.00003359849,0.0001631902,0.00002748343,0.0008836333,0.9095029,0.0009095965,0.08771912,0.000007262011,0.0002305332],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.02474862,0.00006545189,0.9704618,0.0002060128,0.00001498222,0.0003216612,0.000008388952,0.00009003556,0.004083058],"genre_scores_gemma":[0.8661031,0.00003262675,0.1337034,0.00002193499,0.00000528693,0.0000767701,0.00001502381,0.00001396018,0.00002794661],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8413544,"threshold_uncertainty_score":0.6298531,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02822677562133897,"score_gpt":0.3024998840984041,"score_spread":0.2742731084770652,"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."}}