{"id":"W1595947196","doi":"10.1109/vetecs.2006.1682764","title":"Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation","year":2006,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":15,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Integer programming; Computer science; Routing (electronic design automation); Mathematical optimization; Heuristic; Path (computing); Wireless network; Static routing; Wireless; Computer network; Geographic routing; Routing protocol; Distributed computing; Mathematics; 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.002273842,0.002216201,0.001552919,0.00069204,0.0006515873,0.00240689,0.001957773,0.002617837,0.003134533],"category_scores_gemma":[0.003821961,0.0008577859,0.001029753,0.002329782,0.001227637,0.002809957,0.001196021,0.002636713,0.0006906195],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001250454,"about_ca_system_score_gemma":0.001380105,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002751273,"about_ca_topic_score_gemma":0.002724692,"domain_scores_codex":[0.9987362,0.0006262988,0.00004132473,0.0001978156,0.000249326,0.0001490182],"domain_scores_gemma":[0.998187,0.001421217,0.0001529751,0.00004496529,0.0001344014,0.00005937344],"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.00003940895,0.0001151959,0.0002853928,0.0003080519,0.00004336945,0.0001845934,0.0001071482,0.8538197,0.0006214665,0.1179387,0.004572157,0.02196476],"study_design_scores_gemma":[0.00001920278,0.00005635545,0.00007532309,0.00004856809,0.0000204927,0.00006042748,0.00004948456,0.949884,0.000289737,0.04404407,0.005438819,0.00001347273],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005254271,0.001976988,0.9820135,0.001395472,0.0001842218,0.0000937859,0.0002281251,0.00007472901,0.00877886],"genre_scores_gemma":[0.2481617,0.007047676,0.7283276,0.0008496771,0.0008262162,0.0009902879,0.0005476989,0.0001559116,0.01309322],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003134533,"threshold_uncertainty_score":0.01202536,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008580403349341039,"score_gpt":0.2261505017655167,"score_spread":0.2175700984161756,"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."}}