{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009253761,0.000501026,0.001421088,0.0009292836,0.0008438323,0.001020553,0.001341932,0.001698487,0.002202085],"category_scores_gemma":[0.004865237,0.0005882717,0.0006885651,0.001143054,0.001059948,0.001694118,0.001639573,0.0009840815,0.000277086],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008763949,"about_ca_system_score_gemma":0.0008613302,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00389243,"about_ca_topic_score_gemma":0.00387529,"domain_scores_codex":[0.9996278,0.0001395843,0.00001713225,0.00005773716,0.000063395,0.00009423943],"domain_scores_gemma":[0.9971692,0.00217514,0.0001527412,0.0001201609,0.0001750864,0.0002077141],"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.000384163,0.00009910363,0.000574313,0.00008483964,0.0000380745,0.00008505457,0.0001766715,0.944491,0.002802428,0.02959995,0.00117797,0.02048649],"study_design_scores_gemma":[0.00002413622,0.0000322062,0.0000577928,0.000006431841,0.000007299827,0.00001318297,0.00002437059,0.9898229,0.000256462,0.009559068,0.0001923649,0.000003899677],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2401027,0.0008275246,0.749135,0.0007560819,0.00009410093,0.0001037229,0.0001395153,0.0003535709,0.008487774],"genre_scores_gemma":[0.8766828,0.0003055881,0.1170248,0.00008018711,0.00004490897,0.0001021082,0.00009592767,0.00009953148,0.005564],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00389243,"threshold_uncertainty_score":0.007739544,"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."}}