{"id":"W2909573631","doi":"10.1109/smc.2018.00569","title":"Constrained Optimization with Partial CP-Nets","year":2018,"lang":"en","type":"article","venue":"","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":17,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Regina","funders":"","keywords":"Directed acyclic graph; Topological sorting; Computer science; Pruning; Partially ordered set; Preference; Set (abstract data type); Beam search; Bidirectional search; Theoretical computer science; Mathematics; Search algorithm; Algorithm; Combinatorics; Best-first search","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.002081614,0.001189659,0.0009720206,0.0008537552,0.0004945422,0.001578725,0.001113044,0.0009646703,0.005285981],"category_scores_gemma":[0.006060971,0.0006692701,0.001101749,0.001558879,0.001208083,0.001935134,0.001799761,0.001672214,0.0004033012],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001358058,"about_ca_system_score_gemma":0.001896997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00638685,"about_ca_topic_score_gemma":0.008641996,"domain_scores_codex":[0.9987602,0.0006005283,0.00006264647,0.0001841321,0.0002678506,0.0001246642],"domain_scores_gemma":[0.9975185,0.001939501,0.0001492229,0.0001291226,0.0001923495,0.00007120388],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00006326618,0.00002428556,0.0003139147,0.0001081964,0.00004189762,0.00008075871,0.00002486645,0.8866211,0.0003722676,0.09075487,0.001080164,0.02051453],"study_design_scores_gemma":[0.00002165971,0.00001965487,0.00005898748,0.00001597651,0.000009027821,0.00001739868,0.00001197318,0.9232455,0.000321941,0.07474648,0.001524253,0.00000714248],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009646525,0.000230371,0.9830035,0.0002237511,0.00003182379,0.00008880135,0.0003131489,0.000214384,0.006247685],"genre_scores_gemma":[0.3727238,0.0005728952,0.6176059,0.0003139135,0.00005037676,0.0007285213,0.000980946,0.000178973,0.006844627],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00638685,"threshold_uncertainty_score":0.01768339,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008978296104518087,"score_gpt":0.220240159840578,"score_spread":0.21126186373606,"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."}}