{"id":"W1966387955","doi":"10.1109/iccnc.2012.6167359","title":"A greedy spectrum sharing algorithm for cognitive radio networks","year":2012,"lang":"en","type":"article","venue":"2012 International Conference on Computing, Networking and Communications (ICNC)","topic":"Cognitive Radio Networks and Spectrum Sensing","field":"Computer Science","cited_by":21,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université du Québec à Montréal","funders":"","keywords":"Cognitive radio; Computer science; Greedy algorithm; Algorithm; Scheduling (production processes); Underlay; Graph coloring; Computer network; Graph; Mathematical optimization; Wireless; Telecommunications; Theoretical computer science; Signal-to-noise ratio (imaging); Mathematics","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0009264816,0.0003462011,0.0003381091,0.0002243117,0.0008929766,0.0006291695,0.001800811,0.0001313886,0.00002733378],"category_scores_gemma":[0.00003625107,0.0003643699,0.0001436023,0.0003484219,0.0001934914,0.0005963314,0.001195986,0.0005799052,0.00001632677],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001157742,"about_ca_system_score_gemma":0.00004980822,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004154411,"about_ca_topic_score_gemma":0.00003725118,"domain_scores_codex":[0.9977078,0.0001629428,0.0004814473,0.0005684806,0.0003047808,0.0007745909],"domain_scores_gemma":[0.997346,0.0008589699,0.0003547888,0.0009028729,0.000294196,0.0002431201],"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.0000193983,0.0001965034,0.002027282,0.000004259622,0.0001722656,0.000001907855,0.0006875257,0.00029087,0.000005200245,0.3633491,0.0007536434,0.632492],"study_design_scores_gemma":[0.0006615977,0.0000986274,0.003264755,0.000352553,0.00003316364,0.00007785716,0.0001140874,0.9792824,0.000009072555,0.00501389,0.01066549,0.0004264633],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001624093,0.002648933,0.9717638,0.002005141,0.001980403,0.0004121984,0.000009961022,0.0002495878,0.01930583],"genre_scores_gemma":[0.9572079,0.001150299,0.03851763,0.0005498516,0.002064338,0.0000346408,0.00009116203,0.00003286148,0.0003513015],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9789916,"threshold_uncertainty_score":0.9998809,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06700254253579963,"score_gpt":0.3122691040674316,"score_spread":0.245266561531632,"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."}}