{"id":"W2031332034","doi":"10.1109/jcn.2008.6389840","title":"Minimum energy cooperative path routing in all-wireless networks: NP-completeness and heuristic algorithms","year":2008,"lang":"en","type":"article","venue":"Journal of Communications and Networks","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":13,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"","keywords":"Computer science; Dijkstra's algorithm; Algorithm; Shortest path problem; Constrained Shortest Path First; Heuristic; Routing (electronic design automation); Link-state routing protocol; Private Network-to-Network Interface; Scalability; Mathematical optimization; Destination-Sequenced Distance Vector routing; K shortest path routing; Routing protocol; Computer network; Mathematics; Theoretical computer science; Graph","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.002012337,0.001053456,0.001296043,0.0006979739,0.0008619481,0.0015315,0.001697233,0.001534781,0.001615227],"category_scores_gemma":[0.005864785,0.0005511832,0.0007419321,0.001683245,0.001336114,0.003118014,0.00130091,0.001506016,0.0002158798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001238466,"about_ca_system_score_gemma":0.001412514,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002587562,"about_ca_topic_score_gemma":0.002593974,"domain_scores_codex":[0.9990985,0.000457938,0.00003245757,0.0001165126,0.0001768574,0.0001176717],"domain_scores_gemma":[0.9958534,0.003421082,0.0002462383,0.0001901588,0.0001976841,0.0000915219],"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.00008111609,0.0001040786,0.0003455467,0.0002118664,0.00005226147,0.00009702799,0.0001183748,0.8833709,0.0005557645,0.07936342,0.00350458,0.03219502],"study_design_scores_gemma":[0.00003587118,0.00003334849,0.00008464113,0.00001919976,0.00001618498,0.00005467699,0.00005718984,0.865585,0.0003930374,0.1321373,0.001575518,0.000007971856],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03435619,0.001627683,0.9551567,0.001224736,0.00005879635,0.0001224442,0.0001865193,0.0002072298,0.007059574],"genre_scores_gemma":[0.5796791,0.00313388,0.4106634,0.0003459468,0.000198254,0.000444408,0.0004904599,0.0001229241,0.004921516],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002587562,"threshold_uncertainty_score":0.01064241,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05751421122980483,"score_gpt":0.2881687901388061,"score_spread":0.2306545789090013,"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."}}