{"id":"W2037086109","doi":"10.1109/icpp.2013.20","title":"A Dynamic Moldable Job Scheduling Based Parallel SAT Solver","year":2013,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of New Brunswick","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Computer science; Parallel computing; Solver; Boolean satisfiability problem; Tree (set theory); Scheduling (production processes); Job shop scheduling; Theoretical computer science; Mathematical optimization; Mathematics; Programming language; Schedule","routes":{"ca_aff":true,"ca_fund":true,"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.0004796486,0.0007436168,0.0005732168,0.00049496,0.0005915459,0.0009237143,0.001550778,0.0007487743,0.01106843],"category_scores_gemma":[0.001275657,0.0005073362,0.001085206,0.00109755,0.0004276278,0.0008403987,0.0009086321,0.001055001,0.001469997],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007082343,"about_ca_system_score_gemma":0.002096527,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005600208,"about_ca_topic_score_gemma":0.01055808,"domain_scores_codex":[0.9995727,0.00008938448,0.00002184278,0.000123314,0.0001121791,0.00008066971],"domain_scores_gemma":[0.9994623,0.0002739011,0.00005065462,0.0000876921,0.00008825582,0.00003718185],"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.0003041519,0.0001691487,0.001174644,0.0002778665,0.00009774751,0.0003117597,0.00007380994,0.8390207,0.008783227,0.03589092,0.01762868,0.09626729],"study_design_scores_gemma":[0.00009242471,0.0000455697,0.0001667039,0.000005761915,0.00001443419,0.00005415903,0.00001857928,0.9800541,0.002472742,0.01109506,0.005972438,0.000007980872],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05782711,0.0003270207,0.9011067,0.0007456694,0.0002548179,0.0003414809,0.002109343,0.007001279,0.0302867],"genre_scores_gemma":[0.257171,0.000217733,0.7294673,0.0002374464,0.0000798542,0.0003530663,0.002446359,0.0004118858,0.009615422],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01106843,"threshold_uncertainty_score":0.0370276,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008871722527134177,"score_gpt":0.2185609409823804,"score_spread":0.2096892184552462,"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."}}