{"id":"W1984336606","doi":"10.1145/345848.345852","title":"Worst-case analysis of a dynamic channel assignment strategy (extended abstract)","year":2000,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Channel (broadcasting); Channel allocation schemes; Computer science; Reuse; Greedy algorithm; Node (physics); Mathematical optimization; Interference (communication); Assignment problem; Competitive analysis; Simple (philosophy); Upper and lower bounds; Algorithm; Topology (electrical circuits); Mathematics; Computer network; Wireless; Telecommunications; Combinatorics; Engineering","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.004940057,0.002694011,0.001588283,0.001703901,0.001351293,0.004086001,0.003243683,0.002241495,0.008700101],"category_scores_gemma":[0.02240418,0.0008418105,0.001276475,0.00217033,0.002240934,0.003459394,0.002347482,0.001931215,0.001014596],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003810712,"about_ca_system_score_gemma":0.002660027,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005453602,"about_ca_topic_score_gemma":0.003429301,"domain_scores_codex":[0.9944409,0.001612592,0.0001658009,0.0008045327,0.0011562,0.001819993],"domain_scores_gemma":[0.9777534,0.01542052,0.002261957,0.001323447,0.002002655,0.001238086],"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.0006070546,0.000241121,0.001623531,0.0003174107,0.0001362206,0.0003331474,0.0001411497,0.9092496,0.00523913,0.05840524,0.005159925,0.01854642],"study_design_scores_gemma":[0.00002777958,0.0001321221,0.0002829256,0.00002344602,0.00003889117,0.0001322489,0.00005518359,0.9813121,0.0009956985,0.01618717,0.0007908469,0.00002163796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170929,0.002785933,0.7694968,0.001860296,0.000288028,0.0005439924,0.0009238663,0.0007465914,0.05242557],"genre_scores_gemma":[0.9184757,0.001023434,0.07192089,0.0005336043,0.0002706056,0.0004339662,0.000509406,0.0002557823,0.006576625],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.008700101,"threshold_uncertainty_score":0.02910477,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02957162265171973,"score_gpt":0.3146540562712905,"score_spread":0.2850824336195708,"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."}}