{"id":"W4212966073","doi":"10.5220/0010803100003116","title":"Discrete Mother Tree Optimization and Swarm Intelligence for Constraint Satisfaction Problems","year":2022,"lang":"en","type":"article","venue":"Proceedings of the 14th International Conference on Agents and Artificial Intelligence","topic":"Scheduling and Optimization Algorithms","field":"Engineering","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction; Computer science; Constraint satisfaction problem; Swarm intelligence; Constraint satisfaction dual problem; Mathematical optimization; Tree (set theory); Constraint (computer-aided design); Constraint programming; Constraint logic programming; Artificial intelligence; Particle swarm optimization; Mathematics; Algorithm; Combinatorics; Stochastic programming","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.00222818,0.0007482308,0.001733271,0.001065088,0.0006152255,0.001543532,0.001328935,0.001600689,0.002739245],"category_scores_gemma":[0.007043867,0.0006925433,0.000989584,0.001690179,0.001043949,0.001696374,0.001372789,0.001666841,0.0002731726],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00118441,"about_ca_system_score_gemma":0.001011733,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003873863,"about_ca_topic_score_gemma":0.003085937,"domain_scores_codex":[0.9988862,0.0006384739,0.00005328773,0.0001085872,0.0002342544,0.00007920073],"domain_scores_gemma":[0.9964008,0.002879993,0.0001948965,0.0001372739,0.0002769847,0.0001099653],"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.00006420501,0.00004801438,0.0003065403,0.00007396481,0.00005209765,0.00004146506,0.00006619031,0.9185866,0.0005892146,0.05172288,0.001555518,0.02689323],"study_design_scores_gemma":[0.00000714616,0.000009211984,0.00002109473,0.000002878191,0.000002403046,0.000002830851,0.000004515967,0.992479,0.00005742159,0.007163536,0.0002486111,0.000001423642],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01329768,0.000392828,0.9821713,0.0003932708,0.00008400001,0.00003613074,0.00004938662,0.00007099997,0.003504371],"genre_scores_gemma":[0.4465156,0.0006634523,0.546299,0.0002325178,0.0001723899,0.0002835758,0.0003120896,0.0001266721,0.005394614],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003873863,"threshold_uncertainty_score":0.0117839,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05902317409062221,"score_gpt":0.2823177968179281,"score_spread":0.2232946227273059,"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."}}