{"id":"W2116021531","doi":"10.1109/icc.2005.1495046","title":"Formulation of optimal tree construction for maximum lifetime multicasting in wireless ad-hoc networks with adaptive antennas","year":2005,"lang":"en","type":"article","venue":"","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":20,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Multicast; Wireless ad hoc network; Computer science; Integer programming; Maximization; Computer network; Heuristic; Wireless network; Tree (set theory); Wireless; Linear programming; Distributed computing; Steiner tree problem; Constraint (computer-aided design); Mathematical optimization; Algorithm; Mathematics; Telecommunications; 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.00170589,0.001003072,0.001066985,0.0006887708,0.0005690066,0.001769766,0.001286651,0.001765107,0.003929874],"category_scores_gemma":[0.004068905,0.0007440881,0.0007027528,0.001235042,0.0007197195,0.001512886,0.001092604,0.00107173,0.0005714105],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001490677,"about_ca_system_score_gemma":0.001765182,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003377861,"about_ca_topic_score_gemma":0.003625272,"domain_scores_codex":[0.9993358,0.0003114461,0.00002512149,0.00007791135,0.0001748935,0.00007473466],"domain_scores_gemma":[0.9990132,0.0006822634,0.00009069195,0.00003506685,0.0001254185,0.00005334526],"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.00002316509,0.00002402692,0.000093783,0.0001337007,0.0000130011,0.00006385743,0.00004010604,0.9527388,0.0007313938,0.03355953,0.001562774,0.01101589],"study_design_scores_gemma":[0.00001034236,0.0000241054,0.00003743746,0.00001652136,0.000004927968,0.00001740478,0.00002193679,0.9874538,0.0002781473,0.01069879,0.001430931,0.000005643965],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004469716,0.0003474584,0.9898879,0.0003181704,0.00004047958,0.0001006608,0.000139844,0.00007593975,0.004619913],"genre_scores_gemma":[0.2879849,0.0016016,0.7021964,0.0002417257,0.0002055635,0.001114322,0.0004438584,0.000250924,0.005960832],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003929874,"threshold_uncertainty_score":0.01314676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0131251691173395,"score_gpt":0.2295171987655719,"score_spread":0.2163920296482325,"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."}}