{"id":"W2054925885","doi":"10.1109/vtcspring.2014.7022870","title":"Cross Entropy Optimization for Constrained Green Cooperative Cognitive Radio Network","year":2014,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Toronto Metropolitan University","funders":"","keywords":"Relay; Cognitive radio; Optimization problem; Mathematical optimization; Cross-entropy method; Computer science; Convex optimization; Entropy (arrow of time); Upper and lower bounds; Regular polygon; Power (physics); Wireless; Quadratic assignment problem; Mathematics; 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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001756541,0.001191068,0.00111363,0.000650279,0.0003534361,0.001013212,0.0007779859,0.0008938731,0.001391392],"category_scores_gemma":[0.003119105,0.0004471498,0.0004963776,0.0007246783,0.00123255,0.001276565,0.00152599,0.001011245,0.000144572],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001393861,"about_ca_system_score_gemma":0.0009690127,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002379278,"about_ca_topic_score_gemma":0.001569014,"domain_scores_codex":[0.9991676,0.0004054439,0.00002347483,0.0001301757,0.0001657385,0.0001077528],"domain_scores_gemma":[0.9982979,0.001310601,0.0001245589,0.00005909626,0.0001467208,0.00006106256],"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.00005564827,0.00002461432,0.0002333421,0.00004414062,0.00003679094,0.0000634216,0.00003160535,0.9723121,0.0008882604,0.01815364,0.0005072095,0.007649142],"study_design_scores_gemma":[0.000005695041,0.00001253565,0.00005155165,0.000003177655,0.000004543943,0.000007323129,0.000004802208,0.9934996,0.0001948726,0.006087025,0.0001257074,0.00000322067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03192211,0.0006247158,0.9630215,0.0003705323,0.00004112133,0.00002961513,0.00006253246,0.00009182713,0.003836017],"genre_scores_gemma":[0.9285765,0.0004971551,0.06599561,0.0002547867,0.00006222169,0.0001689703,0.0001447709,0.000079741,0.004220292],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002379278,"threshold_uncertainty_score":0.01011318,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02891953810639229,"score_gpt":0.2915013648957295,"score_spread":0.2625818267893372,"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."}}