{"id":"W1544695114","doi":"10.1007/3-540-44886-1_61","title":"Dueling CSP Representations: Local Search in the Primal versus Dual Constraint Graph","year":2003,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Windsor","funders":"","keywords":"Constraint satisfaction dual problem; Constraint satisfaction problem; Constraint satisfaction; Computer science; Constraint graph; Mathematical optimization; Constraint (computer-aided design); Hybrid algorithm (constraint satisfaction); Dual (grammatical number); Graph; Constraint programming; Local consistency; Constraint logic programming; Representation (politics); Theoretical computer science; Mathematics; Artificial intelligence","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.001816125,0.0007243628,0.001548639,0.0009004321,0.0007167766,0.002433752,0.002104764,0.001561119,0.01220388],"category_scores_gemma":[0.00741499,0.0006726566,0.001003435,0.002288604,0.001144627,0.005630011,0.002287895,0.003316162,0.001213588],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001112586,"about_ca_system_score_gemma":0.001374762,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002329897,"about_ca_topic_score_gemma":0.003689667,"domain_scores_codex":[0.9989893,0.000573666,0.00003438728,0.0001287581,0.000192124,0.00008176708],"domain_scores_gemma":[0.997715,0.001601173,0.0001103426,0.0003361339,0.0001574573,0.00007983462],"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.0001462758,0.0001231752,0.0001532111,0.0003047054,0.00003061447,0.00007528937,0.0001634876,0.2655383,0.001355522,0.5353261,0.01318298,0.1836003],"study_design_scores_gemma":[0.00003393189,0.0000322702,0.00003319536,0.00004155879,0.00001231119,0.00004638567,0.00004079631,0.7284434,0.0007547225,0.2669455,0.003603754,0.00001218323],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.006155062,0.0004148575,0.9816064,0.000495708,0.00006463121,0.00006499967,0.0001099651,0.0004227216,0.01066568],"genre_scores_gemma":[0.2499253,0.001060812,0.7341182,0.0003854656,0.0001567382,0.0003488745,0.0004948442,0.0006048061,0.01290506],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01220388,"threshold_uncertainty_score":0.04082602,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03082609765807935,"score_gpt":0.2827214531049179,"score_spread":0.2518953554468386,"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."}}