{"id":"W1762042173","doi":"10.1007/11734697_10","title":"Solving Dynamic Distributed Constraint Satisfaction Problems with a Modified Weak-Commitment Search Algorithm","year":2006,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":4,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Regina","funders":"","keywords":"Computer science; Constraint satisfaction; Constraint satisfaction problem; Asynchronous communication; Constraint (computer-aided design); Dynamic programming; Algorithm; Dynamic problem; Mathematical optimization; Distributed computing; 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.001536829,0.0009522022,0.001809182,0.0006072234,0.0007269605,0.001237927,0.002898062,0.001837379,0.006737799],"category_scores_gemma":[0.004311428,0.000852589,0.000774258,0.001302198,0.0009390599,0.001806228,0.002799882,0.002354213,0.0008555211],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006821128,"about_ca_system_score_gemma":0.001545403,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002322752,"about_ca_topic_score_gemma":0.003555824,"domain_scores_codex":[0.999047,0.0003254611,0.00005637476,0.0001848566,0.0002726502,0.0001137056],"domain_scores_gemma":[0.9983908,0.001036219,0.00008171147,0.0002261069,0.0001751473,0.00008996255],"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.0003761171,0.0002850663,0.0002791951,0.0001707026,0.0001061876,0.00009063818,0.0001099848,0.8058292,0.003389302,0.04376396,0.004230025,0.1413696],"study_design_scores_gemma":[0.00005628268,0.00002859798,0.00002553824,0.00000371841,0.000007851699,0.000009452739,0.000009327165,0.9915134,0.0002758585,0.007691364,0.0003738784,0.000004653832],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01074579,0.00009574399,0.9853665,0.0001555076,0.0000563324,0.00007646258,0.00003155213,0.0003124057,0.003159799],"genre_scores_gemma":[0.2993658,0.0001094958,0.6936308,0.0001701937,0.00007039009,0.0004796854,0.0001513916,0.000215366,0.005806989],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.006737799,"threshold_uncertainty_score":0.02254015,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01248451798059754,"score_gpt":0.2308659576215335,"score_spread":0.218381439640936,"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."}}