{"id":"W2004011015","doi":"10.1109/iscc.2014.6912513","title":"An efficient heuristic candidate selection algorithm for Opportunistic Routing in wireless multihop networks","year":2014,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Selection algorithm; Network packet; Selection (genetic algorithm); Heuristic; Algorithm; Computer network; Node (physics); Wireless; Routing (electronic design automation); Reliability (semiconductor); Wireless network; Engineering; Artificial intelligence","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.001102032,0.0007097188,0.001119364,0.001316422,0.0008547156,0.0006388105,0.001240919,0.0006129105,0.001147654],"category_scores_gemma":[0.003035243,0.0003121587,0.0004875087,0.001239469,0.0004366635,0.0009888352,0.0008485868,0.0003958162,0.0002936059],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004806133,"about_ca_system_score_gemma":0.0011054,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001562225,"about_ca_topic_score_gemma":0.002353133,"domain_scores_codex":[0.9993104,0.0002425573,0.00003687781,0.00008869344,0.0002296576,0.00009171673],"domain_scores_gemma":[0.9987436,0.0007371011,0.0001487485,0.0001106875,0.000203983,0.0000559532],"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.0004113054,0.0001767763,0.001794424,0.0002086019,0.0001393705,0.0003315393,0.0001683143,0.5038721,0.00761555,0.02013654,0.006524613,0.4586208],"study_design_scores_gemma":[0.00005508548,0.000124271,0.0002847901,0.00001275146,0.00003079322,0.000201768,0.00003155962,0.9888645,0.001706596,0.005643414,0.003026307,0.00001809173],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01610183,0.0006417569,0.9809054,0.00009227521,0.000076507,0.000186733,0.000068826,0.0003915752,0.001534988],"genre_scores_gemma":[0.3853581,0.0005980444,0.6103632,0.0001477764,0.00009185479,0.0004534902,0.0003956992,0.00007093813,0.00252078],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001562225,"threshold_uncertainty_score":0.005828142,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01050922587154063,"score_gpt":0.2484601978332459,"score_spread":0.2379509719617052,"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."}}