{"id":"W54874128","doi":"10.1007/978-3-642-35476-2_9","title":"Tree Exploration by a Swarm of Mobile Agents","year":2012,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université du Québec en Outaouais","funders":"","keywords":"Swarm behaviour; Overhead (engineering); Tree (set theory); Node (physics); Computer science; Range (aeronautics); Mathematical optimization; K-ary tree; Algorithm; Path (computing); Tree structure; Topology (electrical circuits); Mathematics; Combinatorics; Artificial intelligence; Computer network; Binary tree; Engineering","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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0007450655,0.0003097798,0.0003727016,0.0005374961,0.000121722,0.0002198409,0.002115987,0.0002101237,0.00006254511],"category_scores_gemma":[0.00003700822,0.0002838174,0.00008864324,0.0005393076,0.0003814602,0.001193192,0.0007824291,0.0003820941,0.00004848512],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001126362,"about_ca_system_score_gemma":0.000263818,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001157871,"about_ca_topic_score_gemma":0.00001432689,"domain_scores_codex":[0.9972406,0.00004019449,0.0004898473,0.0007830643,0.0009661685,0.0004801092],"domain_scores_gemma":[0.9981852,0.0001638367,0.0002997751,0.0009122694,0.000260766,0.0001781326],"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.000003256155,0.00007786678,0.00002461578,0.00004202155,0.000008822113,0.000005132645,0.002039765,0.05737295,0.0003450958,0.007701184,0.0003522929,0.932027],"study_design_scores_gemma":[0.0004154935,0.000345249,0.00001785853,0.0002422556,0.000006950023,0.00001217883,5.411048e-7,0.9368632,0.007701876,0.04421941,0.009537064,0.0006378668],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00002436168,0.0006303014,0.9939011,0.0002941563,0.0007079994,0.0004619883,0.000006316649,0.00008465082,0.003889177],"genre_scores_gemma":[0.1918959,0.0007056023,0.8030826,0.001575866,0.0004122573,0.00007360164,0.00004637705,0.00006878076,0.002139],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9313892,"threshold_uncertainty_score":0.9999614,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03469620171354885,"score_gpt":0.2732626250365877,"score_spread":0.2385664233230388,"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."}}