{"id":"W3010667731","doi":"10.5220/0008877803220330","title":"Discrete Focus Group Optimization Algorithm for Solving Constraint Satisfaction Problems","year":2020,"lang":"en","type":"article","venue":"","topic":"Scheduling and Timetabling Solutions","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Constraint satisfaction problem; Computer science; Focus (optics); Constraint satisfaction; Group (periodic table); Algorithm; Constraint (computer-aided design); Mathematical optimization; Mathematics; Artificial intelligence","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":[],"consensus_categories":[],"category_scores_codex":[0.001190894,0.0001266948,0.0002138269,0.0001099067,0.0003411351,0.0003797786,0.000218388,0.00007787287,0.0006217937],"category_scores_gemma":[0.002078231,0.00009565469,0.0001445652,0.0006003786,0.0000760492,0.0004037422,0.00005116338,0.0001067064,0.0001066897],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002673171,"about_ca_system_score_gemma":0.0000570304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00009021851,"about_ca_topic_score_gemma":0.00004510642,"domain_scores_codex":[0.9981114,0.00005374455,0.0005153235,0.0004849558,0.0005583252,0.0002762117],"domain_scores_gemma":[0.9984284,0.000716761,0.0001751949,0.000213616,0.0002814783,0.0001845493],"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.00001710643,0.00003194633,0.001199162,0.000007124615,0.00005295435,0.000001087438,0.000705199,0.2770215,0.0007548253,0.012413,0.00456978,0.7032263],"study_design_scores_gemma":[0.0004443759,0.000103294,0.00027284,0.000007709422,0.00002125998,0.000003784433,0.0005079824,0.9883116,0.0002158578,0.008023466,0.001943008,0.0001447971],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0004346394,0.00007234671,0.9923757,0.004843288,0.0003038698,0.0004025864,0.00004032675,0.0001909828,0.001336298],"genre_scores_gemma":[0.4341433,0.000007267849,0.565102,0.0002867452,0.0001788372,0.00004034521,0.00001687243,0.00001254511,0.0002120477],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7112901,"threshold_uncertainty_score":0.6808205,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1036436467692072,"score_gpt":0.3452219852240495,"score_spread":0.2415783384548423,"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."}}