{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0003748569,0.0003732323,0.000838919,0.0005000031,0.0006945139,0.0009427404,0.0009376201,0.001395214,0.002353007],"category_scores_gemma":[0.001541313,0.0003847171,0.0006169066,0.0006674572,0.0006269938,0.001269761,0.001122688,0.0006046993,0.0003554325],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003017405,"about_ca_system_score_gemma":0.0003404765,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001219836,"about_ca_topic_score_gemma":0.001139347,"domain_scores_codex":[0.9998635,0.00003944741,0.000006831672,0.00003081046,0.00003340389,0.0000260808],"domain_scores_gemma":[0.9994178,0.0003384969,0.00005072013,0.00004918998,0.0000601319,0.00008367489],"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.0004306083,0.0001196444,0.001992384,0.0001888036,0.0001554697,0.0005198577,0.0005332713,0.8661976,0.01991051,0.03521407,0.003070871,0.07166693],"study_design_scores_gemma":[0.00002994701,0.00007821825,0.0001512046,0.000009046461,0.00001529666,0.00006194599,0.00004261608,0.9891036,0.0006863028,0.008745555,0.001068952,0.000007340511],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3100246,0.001056297,0.6745787,0.0006850471,0.0001782696,0.00008358133,0.00008524244,0.0004355076,0.0128728],"genre_scores_gemma":[0.8716196,0.0004146455,0.118336,0.00010985,0.00007314455,0.0001036577,0.0001049593,0.00007466115,0.009163422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002353007,"threshold_uncertainty_score":0.007871628,"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."}}