{"id":"W2963945095","doi":"10.1016/j.tcs.2019.07.018","title":"Energy-optimal broadcast and exploration in a tree using mobile agents","year":2019,"lang":"en","type":"article","venue":"Theoretical Computer Science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Tree (set theory); Node (physics); Computer science; Enhanced Data Rates for GSM Evolution; Mobile agent; Root (linguistics); Set (abstract data type); Broadcasting (networking); Energy (signal processing); Algorithm; Mathematics; Combinatorics; Theoretical computer science; Distributed computing; Computer network; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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.0007632848,0.000114686,0.0001376355,0.0002527651,0.0001299537,0.0004367053,0.0008366191,0.00003707956,0.00004000137],"category_scores_gemma":[0.00001226688,0.0001005036,0.00002127597,0.001014851,0.0006217645,0.001504688,0.0007591662,0.000101985,0.0000264238],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00005148707,"about_ca_system_score_gemma":0.00008700504,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008105823,"about_ca_topic_score_gemma":9.612105e-7,"domain_scores_codex":[0.9983081,0.0001002901,0.0002017174,0.000551754,0.0004523373,0.000385793],"domain_scores_gemma":[0.9992394,0.00006995698,0.0000393717,0.0003929729,0.00008829562,0.0001700307],"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.000005382399,0.00005153474,0.0002866033,0.000005120848,0.000001076918,0.000005564519,0.0009455549,0.02918507,0.0007331908,0.906978,0.000005127442,0.06179779],"study_design_scores_gemma":[0.0002875583,0.0001623655,0.0002489482,0.00002238053,6.297281e-7,0.00001260258,0.00001384255,0.9830645,0.0006271444,0.01535136,0.00007839336,0.0001302971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.170836,0.00001644761,0.8276325,0.000153952,0.0001705904,0.0001506314,2.795021e-7,0.00005196885,0.000987714],"genre_scores_gemma":[0.8383829,0.00001152317,0.1613046,0.0002528456,0.00002026951,0.000006596182,4.684665e-7,0.000004411227,0.00001638715],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9538794,"threshold_uncertainty_score":0.4211159,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02310341689472948,"score_gpt":0.2757461246963497,"score_spread":0.2526427078016202,"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."}}