{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003316719,0.000168922,0.0002569109,0.0001128539,0.0000631418,0.00004410743,0.0003052199,0.0001058034,0.000008317068],"category_scores_gemma":[0.00001654893,0.0001456291,0.000053315,0.0004109322,0.00006705867,0.0007219571,0.00009524551,0.0001425476,0.00000195089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00007614334,"about_ca_system_score_gemma":0.0000486895,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001092409,"about_ca_topic_score_gemma":0.0002811385,"domain_scores_codex":[0.9985978,0.00004551258,0.0004126218,0.0003851598,0.0001888884,0.0003700215],"domain_scores_gemma":[0.9989552,0.0002880767,0.0002175496,0.000297456,0.0001711202,0.00007057926],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002410457,0.00006819796,0.0009846833,0.000008822004,0.00001893705,0.000002374662,0.0002780572,0.3679172,0.0001519659,0.01372714,0.00002580563,0.6165758],"study_design_scores_gemma":[0.001343573,0.0003431128,0.001599013,0.00008701895,0.000008124473,0.0000218078,0.00009383036,0.9955882,0.0005285603,0.0001396709,0.00006736889,0.0001796937],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.06906918,0.00008336886,0.9295145,0.0001253569,0.00008392254,0.0005867613,0.000001111052,0.00009204834,0.0004438071],"genre_scores_gemma":[0.5773954,0.000008535842,0.4224283,0.00002982585,0.00006534841,0.00003510818,0.000002646803,0.000009750623,0.00002504714],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.6276711,"threshold_uncertainty_score":0.5938582,"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."}}