{"id":"W22032000","doi":"10.1007/978-3-642-29222-4_26","title":"Time and Power Scheduling in a Wireless Network with Network Coding and Bidirectional Relaying","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University","funders":"","keywords":"Linear network coding; Computer network; Computer science; Wireless network; Maximum throughput scheduling; Relay; Node (physics); Scheduling (production processes); Wireless; Quality of service; Power (physics); Telecommunications; Engineering; Network packet; Round-robin scheduling; Dynamic priority scheduling","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.000421014,0.0004975467,0.0003588444,0.0002846357,0.0003117268,0.0007570789,0.00064858,0.0004299122,0.001524304],"category_scores_gemma":[0.0009351862,0.0002493185,0.0002093283,0.0007555853,0.0005444438,0.0008801453,0.0004051219,0.000710838,0.0002862299],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007255141,"about_ca_system_score_gemma":0.000621439,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001358256,"about_ca_topic_score_gemma":0.002018438,"domain_scores_codex":[0.9998158,0.00005812262,0.000009652428,0.00003219711,0.00005844823,0.00002591328],"domain_scores_gemma":[0.999579,0.0002734752,0.00003378332,0.00003662867,0.00005751222,0.00001943205],"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.0001555854,0.00004951607,0.0001447789,0.0001314393,0.00002233003,0.0001567227,0.0001357319,0.528593,0.01413394,0.3581595,0.003226558,0.0950909],"study_design_scores_gemma":[0.00001914212,0.00006259351,0.00009798226,0.00001896421,0.00001734025,0.00007843097,0.00002520091,0.844652,0.002454389,0.1478117,0.004743484,0.00001877723],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04095433,0.002124185,0.9328647,0.0004199947,0.0002597062,0.00004596366,0.00009248196,0.0001893998,0.02304913],"genre_scores_gemma":[0.7745479,0.003595581,0.1924574,0.0001138615,0.0003514886,0.0001261965,0.0001047987,0.0001419153,0.0285609],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001524304,"threshold_uncertainty_score":0.005263925,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02107095285678252,"score_gpt":0.2295327506512239,"score_spread":0.2084617977944414,"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."}}