{"id":"W1503365423","doi":"10.1007/978-3-540-45193-8_35","title":"Discrepancy-Based Additive Bounding for the AllDifferent Constraint","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":false,"ca_institutions":"Université de Montréal","funders":"","keywords":"Bounding overwatch; Computer science; Constraint programming; Constraint (computer-aided design); Mathematical optimization; Relaxation (psychology); Constraint satisfaction; Upper and lower bounds; Branch and bound; Heuristic; Theoretical computer science; Algorithm; Mathematics; Artificial intelligence; Stochastic programming","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.005704455,0.002433894,0.002727171,0.002142875,0.001083154,0.003218078,0.006342617,0.002098105,0.007034475],"category_scores_gemma":[0.01959979,0.001339957,0.002571929,0.003047325,0.003206155,0.007856573,0.01041493,0.01022081,0.001282303],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002538391,"about_ca_system_score_gemma":0.001596626,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001953704,"about_ca_topic_score_gemma":0.002077474,"domain_scores_codex":[0.9931334,0.002250185,0.0003299985,0.0008792553,0.002898082,0.0005091421],"domain_scores_gemma":[0.9864376,0.009277496,0.000453544,0.002211262,0.001187959,0.0004321829],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002121761,0.00008446006,0.0003612839,0.0003642568,0.00007932057,0.00009714908,0.0001898485,0.1314562,0.003401169,0.732857,0.009292238,0.1216049],"study_design_scores_gemma":[0.00002214474,0.00004478469,0.0001631049,0.00005888796,0.0000350787,0.0001069858,0.00002069529,0.6531085,0.002077358,0.3375594,0.006769391,0.00003367067],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.003039585,0.0009472443,0.9890829,0.0003830318,0.0001419381,0.00002384753,0.00006663503,0.0002245879,0.006090262],"genre_scores_gemma":[0.1914807,0.001796758,0.7871507,0.000585097,0.0006686397,0.0002488119,0.0005818396,0.0007731273,0.01671433],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.007034475,"threshold_uncertainty_score":0.03016835,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01882813346798401,"score_gpt":0.2502116011789794,"score_spread":0.2313834677109954,"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."}}