{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003532891,0.0001823071,0.0001902928,0.00008329828,0.0001087519,0.0002984192,0.0004693215,0.0001109159,0.000009377713],"category_scores_gemma":[0.00000703756,0.000161816,0.00003821056,0.000697393,0.00002260159,0.001136483,0.0001739068,0.0001577589,0.000003012436],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009596791,"about_ca_system_score_gemma":0.00004307825,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0009958779,"about_ca_topic_score_gemma":0.002954657,"domain_scores_codex":[0.9983191,0.0001235753,0.000399701,0.0004792554,0.0001934752,0.0004849187],"domain_scores_gemma":[0.9992403,0.00009747968,0.000106999,0.0003904953,0.00009685569,0.00006788858],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000007533226,0.0001459242,0.004384153,0.000002041707,0.000004561552,0.00002125961,0.0003262119,0.1347761,0.0001044126,0.6394717,0.0001955938,0.2205606],"study_design_scores_gemma":[0.0002896491,0.00008521625,0.001321394,0.00003462577,0.000001525408,0.000004989946,0.00005393901,0.9966323,0.0002420667,0.0007149022,0.0004020504,0.0002173882],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04778793,0.0000329666,0.9492974,0.00005615977,0.0001795669,0.0002031231,1.37892e-7,0.000220192,0.002222546],"genre_scores_gemma":[0.980252,0.000003192434,0.01895681,0.0001799772,0.0002540454,0.00006817009,0.00002130359,0.00001530611,0.0002492422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.932464,"threshold_uncertainty_score":0.6598664,"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."}}