{"id":"W2890194468","doi":"10.20944/preprints201809.0329.v1","title":"A Simple Ant Colony Optimization Algorithm to Select Cluster Heads in Ad Hoc Networks","year":2018,"lang":"en","type":"preprint","venue":"Preprints.org","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"","keywords":"Computer science; Cluster analysis; Ant colony optimization algorithms; Scalability; Wireless ad hoc network; Cluster (spacecraft); Algorithm; Simple (philosophy); Selection (genetic algorithm); k-medoids; Stability (learning theory); Correlation clustering; CURE data clustering algorithm; Artificial intelligence; Computer network; Machine learning","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","open_science"],"consensus_categories":[],"category_scores_codex":[0.001908307,0.0006980612,0.0008537382,0.0004061724,0.0001613494,0.0002231756,0.003336209,0.0008267852,0.0003438125],"category_scores_gemma":[0.0001901604,0.0007824056,0.0002199212,0.001205205,0.00009537706,0.0003658446,0.01014304,0.00151739,0.0007097246],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006835358,"about_ca_system_score_gemma":0.0003947254,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001374099,"about_ca_topic_score_gemma":0.0002478363,"domain_scores_codex":[0.9939508,0.0005699852,0.001064138,0.002593787,0.0006414136,0.001179868],"domain_scores_gemma":[0.9951314,0.0002155728,0.0004581661,0.0033767,0.0003981386,0.0004199637],"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.00004930934,0.0001738022,0.02024842,0.00003949036,0.00005749293,0.00003510013,0.0008665474,0.95542,0.00001722059,0.00005357127,0.001955681,0.0210834],"study_design_scores_gemma":[0.0005420235,0.0001107756,0.02437309,0.0002401058,0.0000188967,0.00001733919,0.000006841857,0.9651094,0.0003068724,0.0007734472,0.007714188,0.0007870377],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04911504,0.0004649267,0.944066,0.0006663435,0.001815531,0.002458275,0.00001061151,0.0005201318,0.0008830587],"genre_scores_gemma":[0.7624909,0.0009992977,0.2293135,0.00288865,0.001380904,0.001802433,0.0001703071,0.0001788852,0.0007750955],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7147526,"threshold_uncertainty_score":0.9994627,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.04594270196105719,"score_gpt":0.3168136811283892,"score_spread":0.270870979167332,"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."}}