{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001517375,0.0003565924,0.0003063231,0.000894727,0.0003079669,0.00062316,0.001516851,0.0002324302,0.00005962046],"category_scores_gemma":[0.0001440282,0.000298938,0.000114027,0.001088,0.001345956,0.0005338141,0.0003784673,0.001032927,0.00002126487],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002731761,"about_ca_system_score_gemma":0.0006973882,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00004732596,"about_ca_topic_score_gemma":0.0002681065,"domain_scores_codex":[0.9964808,0.0001442042,0.0005465903,0.001153878,0.001121573,0.0005529024],"domain_scores_gemma":[0.9975525,0.0009948432,0.0001599567,0.0009704367,0.0002160983,0.0001062027],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00001393498,0.00002930502,0.0001295167,0.00001399166,0.000009777775,0.0001462157,0.001892915,0.3809335,0.00001404021,0.08689285,0.00002320474,0.5299008],"study_design_scores_gemma":[0.001413039,0.0002293342,0.0008319006,0.0002365276,0.00001237173,0.0003893817,0.00002032218,0.9371318,0.000259615,0.05803654,0.0005977305,0.0008414299],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00009891197,0.0001383939,0.9890409,0.002210455,0.001531526,0.0005002455,0.000003676317,0.00007498704,0.006400881],"genre_scores_gemma":[0.5717926,0.0001141272,0.4245741,0.003105661,0.0002612372,0.00002466827,0.00001494374,0.00003065647,0.00008200862],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.5716937,"threshold_uncertainty_score":0.9999463,"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."}}