{"id":"W2586424584","doi":"10.1109/intech.2016.7845071","title":"Solving the MAX-SAT problem by binary enhanced fireworks algorithm","year":2016,"lang":"en","type":"article","venue":"","topic":"Metaheuristic Optimization Algorithms Research","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Simon Fraser University","funders":"","keywords":"Algorithm; Binary number; Binary search algorithm; Computer science; Genetic algorithm; Differential evolution; Mathematical optimization; Mathematics; Search algorithm","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.0007791606,0.0001711292,0.0001596292,0.00008447206,0.0002742143,0.000298766,0.001723091,0.00008089162,0.0007925045],"category_scores_gemma":[0.0001656561,0.00008356529,0.00006152802,0.000603432,0.0001252436,0.0005631355,0.0006962707,0.0001722406,0.0006580275],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00006285708,"about_ca_system_score_gemma":0.0001031929,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001680899,"about_ca_topic_score_gemma":0.000001354326,"domain_scores_codex":[0.9977835,0.0001948211,0.0003049347,0.0005233717,0.0006646035,0.0005287828],"domain_scores_gemma":[0.998051,0.000572456,0.00008627073,0.0009267959,0.0002054154,0.0001580381],"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.000002229103,0.00005771453,0.00001181461,0.000005219014,0.00002094505,0.000007263366,0.0001673671,0.00005995968,0.00436528,0.003755389,0.04918279,0.942364],"study_design_scores_gemma":[0.0007387564,0.0001349032,0.0001076635,0.0000772213,0.000005647621,0.0000185032,0.00003332898,0.9507125,0.01820906,0.004068444,0.02548025,0.0004137111],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0000650166,0.0002051617,0.9812035,0.01006295,0.0002445881,0.0003380576,0.000004998421,0.0002520691,0.007623635],"genre_scores_gemma":[0.01493385,0.0003105495,0.926473,0.0007615569,0.0001149637,0.0001073394,0.000004123257,0.00002678213,0.05726783],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.9506525,"threshold_uncertainty_score":0.8677369,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01113340971147489,"score_gpt":0.2505527383637696,"score_spread":0.2394193286522947,"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."}}