{"id":"W2113242882","doi":"10.1109/vetecf.2003.1285363","title":"A relaying algorithm for multihop TDMA TDD networks using diversity","year":2003,"lang":"en","type":"article","venue":"","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Computer network; Time division multiple access; Throughput; Channel (broadcasting); Routing algorithm; Selection algorithm; Distributed computing; Routing (electronic design automation); Algorithm; Selection (genetic algorithm); Routing protocol; Wireless; 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.0005468753,0.0004049781,0.0003441473,0.0004614611,0.0005964703,0.0004359357,0.0008101402,0.0006105772,0.0009197671],"category_scores_gemma":[0.001378434,0.0001742997,0.0002795167,0.0004084915,0.0003339795,0.0007171763,0.0004493221,0.0005534329,0.0004417599],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005821316,"about_ca_system_score_gemma":0.000524907,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001017866,"about_ca_topic_score_gemma":0.001629269,"domain_scores_codex":[0.9997783,0.0000456684,0.00001797574,0.00004541922,0.00009141466,0.00002117555],"domain_scores_gemma":[0.9994937,0.000225217,0.00005481203,0.00008074269,0.0001275262,0.00001804101],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0001228902,0.00006818233,0.0005523578,0.0001631098,0.00006108537,0.0001680437,0.0002376547,0.1399769,0.06092609,0.05202784,0.002637369,0.7430586],"study_design_scores_gemma":[0.0000958832,0.0003381667,0.0003795811,0.00002868264,0.00005569318,0.0008256994,0.00005240959,0.9183753,0.02988448,0.02542176,0.0244872,0.00005517562],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006090241,0.0002790996,0.9919237,0.00009264385,0.00005070397,0.00005134922,0.00001527699,0.0002472383,0.001249747],"genre_scores_gemma":[0.1799371,0.0004071557,0.8160825,0.00008901816,0.00005428463,0.0001576165,0.00007660427,0.00005284695,0.003142844],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001017866,"threshold_uncertainty_score":0.004223645,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.08355126861563636,"score_gpt":0.2960899173584639,"score_spread":0.2125386487428275,"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."}}