{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0006335124,0.0006276605,0.0005279169,0.0008525603,0.0004491738,0.000856042,0.001123998,0.0003203918,0.00003522492],"category_scores_gemma":[0.00001931153,0.0005597824,0.0001122424,0.0007772488,0.0009067138,0.0007137214,0.0005034568,0.0009421294,0.00001734796],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001016739,"about_ca_system_score_gemma":0.0008425759,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0002376488,"about_ca_topic_score_gemma":0.0008331379,"domain_scores_codex":[0.9956968,0.00005887417,0.0006334336,0.001584649,0.001265032,0.0007611805],"domain_scores_gemma":[0.9978143,0.0002483888,0.0003371752,0.001004271,0.0003924887,0.000203357],"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.000002894706,0.00001739494,0.0000851537,0.00002004098,0.00001346551,0.00002744001,0.0001323778,0.4066425,0.00003743434,0.003115542,0.000007274612,0.5898985],"study_design_scores_gemma":[0.0005559859,0.0001723957,0.001488529,0.0003705454,0.00001270089,0.0001998042,7.357688e-7,0.9874122,0.0001270929,0.008814697,0.0001686312,0.0006766575],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00005527064,0.00009190516,0.9947758,0.0007056095,0.0007210724,0.0009410768,0.00004579612,0.0003286041,0.002334859],"genre_scores_gemma":[0.309451,0.00004337141,0.6896888,0.0002267111,0.0001258058,0.00003145259,0.00009562754,0.00004699028,0.000290291],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5892218,"threshold_uncertainty_score":0.9996853,"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."}}