{"id":"W2227333382","doi":"10.1609/socs.v1i1.18180","title":"Computing Equivalent Transformations for Combinatorial Optimization by Branch-and-Bound Search","year":2010,"lang":"en","type":"article","venue":"Proceedings of the International Symposium on Combinatorial Search","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Maximum satisfiability problem; Solver; Branch and bound; Pruning; Bounding overwatch; Mathematical optimization; Transformation (genetics); Computer science; Context (archaeology); Domain (mathematical analysis); Local search (optimization); Boolean satisfiability problem; Mathematics; Algorithm; Artificial intelligence; Boolean function","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.002136211,0.001506058,0.00118613,0.001472689,0.0007146118,0.002086186,0.001533591,0.001029748,0.01012359],"category_scores_gemma":[0.01040487,0.0005139856,0.001214301,0.002116331,0.001825468,0.003074763,0.002005038,0.002734905,0.002119539],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001194591,"about_ca_system_score_gemma":0.001920795,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00212466,"about_ca_topic_score_gemma":0.003097415,"domain_scores_codex":[0.997801,0.0008698679,0.0001243389,0.0002480519,0.0007855076,0.0001712675],"domain_scores_gemma":[0.9967348,0.002362702,0.0001532162,0.0004578909,0.0002436704,0.00004771606],"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.0002190513,0.0002098019,0.0006846333,0.0003418899,0.00006457747,0.0001537226,0.0001646276,0.445519,0.00613644,0.2438087,0.007013279,0.2956841],"study_design_scores_gemma":[0.00006348087,0.00006569747,0.0001029663,0.00002971622,0.00002185685,0.00005397364,0.00004167913,0.8298963,0.004293427,0.160176,0.005242219,0.0000126788],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.005004511,0.00008838412,0.9890684,0.000113224,0.00001967792,0.00006602774,0.00006241021,0.0008635907,0.004713748],"genre_scores_gemma":[0.1279517,0.0002409791,0.8682326,0.0001446059,0.00004670542,0.0003303746,0.0005594918,0.0006363438,0.001857124],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01012359,"threshold_uncertainty_score":0.03386676,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01213545434067036,"score_gpt":0.2629143388659637,"score_spread":0.2507788845252933,"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."}}