{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":[],"category_scores_codex":[0.0004947178,0.0001249535,0.000263099,0.0003831596,0.0001027112,0.0001208816,0.001398945,0.00006581812,0.001414134],"category_scores_gemma":[0.000008036156,0.0001102639,0.0001476091,0.002225092,0.00007082317,0.0003080424,0.0002180057,0.0001920837,0.00007167637],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007435019,"about_ca_system_score_gemma":0.00007245941,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002792436,"about_ca_topic_score_gemma":0.0004005617,"domain_scores_codex":[0.9983986,0.0001019208,0.00038991,0.0003381584,0.0004515063,0.0003198755],"domain_scores_gemma":[0.9978646,0.0001934779,0.0000922964,0.001606113,0.000105066,0.0001384197],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00002139422,0.0006440337,0.00005147328,0.00001324139,0.000912913,0.0002701562,0.0006126343,0.1691605,0.0003395778,0.0179273,0.0003171907,0.8097296],"study_design_scores_gemma":[0.0001625842,0.00004446981,0.01113257,0.000006389869,0.00003801556,0.00002589128,0.00006611978,0.9873763,0.000108809,0.0008332877,0.00008079754,0.0001247263],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3055404,0.0003885271,0.6468319,0.001431273,0.00004776428,0.0004383887,0.00001192379,0.0002868427,0.04502298],"genre_scores_gemma":[0.99235,0.0001342935,0.005605326,0.00005155093,0.00000604785,0.00002386325,0.000009854042,0.000006745172,0.001812279],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8182158,"threshold_uncertainty_score":0.9994987,"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."}}