{"id":"W2810546111","doi":"10.1002/dac.3555","title":"Relax online resource allocation algorithms for D2D communication","year":2018,"lang":"en","type":"article","venue":"International Journal of Communication Systems","topic":"Advanced MIMO Systems Optimization","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"Lakehead University","funders":"","keywords":"Computer science; Algorithm; Online algorithm; Cellular network; Bipartite graph; Matching (statistics); Blossom algorithm; Scheduling (production processes); Mathematical optimization; Theoretical computer science; Computer network; 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":[],"consensus_categories":[],"category_scores_codex":[0.001002261,0.0001638143,0.0002700282,0.0003376782,0.0001307393,0.0001338087,0.001380978,0.0001272607,0.00001056415],"category_scores_gemma":[0.0001935056,0.0001689817,0.0001077238,0.0002037561,0.000100255,0.0006690797,0.00008165875,0.0002388186,0.00001709781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003834996,"about_ca_system_score_gemma":0.00004877433,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002046917,"about_ca_topic_score_gemma":0.00002263614,"domain_scores_codex":[0.9979437,0.0001938518,0.001195073,0.0001085705,0.000410365,0.0001484137],"domain_scores_gemma":[0.9954235,0.0003562729,0.0007902545,0.0007182763,0.002635557,0.00007614026],"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.0003624043,0.0003921719,0.0003542083,0.00008218695,0.001186715,0.000003136661,0.004813978,0.8544984,0.007983371,0.03069782,0.03086414,0.06876145],"study_design_scores_gemma":[0.001600884,0.0001776125,0.0002032222,0.0009004759,0.00005857087,0.0001918757,0.002125155,0.6752178,0.002081731,0.001423556,0.3156619,0.0003571753],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00608634,0.005861613,0.9814022,0.001347835,0.001738259,0.0005461126,0.00006442081,0.0001722763,0.002781],"genre_scores_gemma":[0.9492831,0.001131452,0.04815194,0.00006360823,0.000809014,0.00004222708,0.0002604815,0.000056972,0.0002012039],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9431968,"threshold_uncertainty_score":0.6890872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02933013232330449,"score_gpt":0.3118954219312645,"score_spread":0.28256528960796,"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."}}