{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002028349,0.001084915,0.001303875,0.0005694895,0.0004909589,0.001473488,0.001679446,0.001123303,0.005707915],"category_scores_gemma":[0.005972002,0.0005615216,0.0007141001,0.001164048,0.0007658551,0.00178358,0.001874517,0.001652184,0.000741123],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001223093,"about_ca_system_score_gemma":0.001658848,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003248624,"about_ca_topic_score_gemma":0.002329301,"domain_scores_codex":[0.9984138,0.0006498565,0.00008598659,0.000261606,0.0003288466,0.0002599305],"domain_scores_gemma":[0.9966297,0.002226806,0.0003240889,0.0003841631,0.0002786764,0.0001565769],"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.0002838113,0.0001594362,0.0004341901,0.0001094044,0.00003582157,0.00004556876,0.00005776588,0.9218946,0.001835107,0.01953283,0.002736337,0.05287516],"study_design_scores_gemma":[0.00002724203,0.00003107002,0.00004991304,0.000004071816,0.000003777962,0.00001516852,0.00001097314,0.9941213,0.0004070671,0.004824872,0.000500835,0.000003747665],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0245132,0.0003073912,0.968905,0.0003278652,0.00007210912,0.0001266653,0.0001449111,0.000389225,0.005213646],"genre_scores_gemma":[0.6684979,0.0003214311,0.3246718,0.0002720633,0.00008142443,0.000330663,0.0004048108,0.0001721175,0.005247707],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005707915,"threshold_uncertainty_score":0.01909488,"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."}}