{"id":"W2105361910","doi":"10.1109/cwit.2007.375688","title":"An Efficient User Removal Algorithm for Limited-Power Interference Channels","year":2007,"lang":"en","type":"article","venue":"","topic":"Wireless Communication Networks Research","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Constraint (computer-aided design); Interference (communication); Quality of service; Transmitter power output; Algorithm; Power (physics); Boundary (topology); Mathematical optimization; Algorithm design; Transmitter; Computer network; Mathematics; Channel (broadcasting)","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.001014904,0.0008819137,0.001503879,0.0008231747,0.000936505,0.001068561,0.001836781,0.001426301,0.002999385],"category_scores_gemma":[0.003975401,0.0005019385,0.000629854,0.001009138,0.0008502286,0.001463489,0.001560385,0.001168301,0.001394058],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006065732,"about_ca_system_score_gemma":0.001760966,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001640004,"about_ca_topic_score_gemma":0.002139341,"domain_scores_codex":[0.9988433,0.0003412839,0.00005098158,0.0001949666,0.0003943725,0.0001751016],"domain_scores_gemma":[0.9987405,0.0007255157,0.0001058487,0.0001836693,0.0001934516,0.00005104054],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0005727422,0.0002423558,0.000771821,0.0002570158,0.00008757175,0.0002289157,0.0002802793,0.4227315,0.02224191,0.04253495,0.007855902,0.5021951],"study_design_scores_gemma":[0.00007067941,0.00005558753,0.00009626737,0.000007795437,0.00001410715,0.0001708315,0.00002347349,0.9807748,0.004288825,0.01213684,0.002343752,0.00001710551],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004193917,0.0001011418,0.9943304,0.00005733465,0.00002175572,0.00003327338,0.00001697462,0.0004206657,0.0008244321],"genre_scores_gemma":[0.09592534,0.0001322714,0.9007956,0.0001128145,0.00004302619,0.0001861848,0.0001802454,0.0001444889,0.002479946],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002999385,"threshold_uncertainty_score":0.01003397,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03602092077636093,"score_gpt":0.3280872643028812,"score_spread":0.2920663435265203,"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."}}