{"id":"W4243865180","doi":"10.1109/glocom.2015.7417306","title":"Relay Selection, Link Scheduling, and Rate Allocation in Dual-Hop Buffer-Aided Networks with Statistical Delay Constraints","year":2015,"lang":"en","type":"article","venue":"2015 IEEE Global Communications Conference (GLOBECOM)","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique; Université du Québec à Montréal; McGill University","funders":"","keywords":"Relay; Computer science; Scheduling (production processes); Mathematical optimization; Resource allocation; Hop (telecommunications); Selection (genetic algorithm); Computer network; Fading; Relay channel; Wireless; Telecommunications; Mathematics; Channel (broadcasting); Power (physics)","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.001692784,0.0009593689,0.0009980506,0.0007238025,0.0005032209,0.001494626,0.001204331,0.0008887656,0.0008758094],"category_scores_gemma":[0.005006112,0.0007241681,0.0002971046,0.00102151,0.000846398,0.001752367,0.0009103097,0.0006245003,0.0001907615],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001324829,"about_ca_system_score_gemma":0.001297964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002442824,"about_ca_topic_score_gemma":0.002466403,"domain_scores_codex":[0.9991282,0.0004004944,0.00002860849,0.0001344459,0.0001524793,0.0001558628],"domain_scores_gemma":[0.9978436,0.001646245,0.0002088499,0.00006921476,0.0001614794,0.00007050711],"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.00009187782,0.00003678723,0.0002753417,0.00004473516,0.00001470567,0.00008054518,0.00005007239,0.9733272,0.00192067,0.01449016,0.000287403,0.00938043],"study_design_scores_gemma":[0.000006536063,0.00001868502,0.00003364344,0.00000215818,0.000004401299,0.00001396925,0.000007561573,0.9962189,0.0003869624,0.003178563,0.0001246441,0.000004009626],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07945067,0.0009384456,0.9166818,0.0002348532,0.00005713112,0.00004661626,0.00006732211,0.0001454942,0.00237773],"genre_scores_gemma":[0.9359331,0.0007085942,0.06104676,0.00006537928,0.00003936663,0.000101251,0.00004996443,0.00003481977,0.002020818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002442824,"threshold_uncertainty_score":0.009612381,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06811820725560093,"score_gpt":0.3225813429994276,"score_spread":0.2544631357438267,"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."}}