{"id":"W2426786974","doi":"10.1016/j.comcom.2013.01.001","title":"Target to sensor allocation: A hierarchical dynamic Distributed Constraint Optimization approach","year":2013,"lang":"en","type":"article","venue":"Computer Communications","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"","keywords":"Computer science; Asynchronous communication; Optimization problem; Wireless sensor network; Distributed computing; Set (abstract data type); Constraint (computer-aided design); Mathematical optimization; Algorithm; Computer network","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":[],"consensus_categories":[],"category_scores_codex":[0.0001935302,0.0002181519,0.0002171797,0.0002405229,0.0004557227,0.0005084735,0.001912443,0.0001002457,0.0001230608],"category_scores_gemma":[0.00005214642,0.0002299452,0.0000864984,0.0009311134,0.0001888958,0.0006473273,0.0009591213,0.0002842406,0.0001833376],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001360173,"about_ca_system_score_gemma":0.0001303301,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00002405529,"about_ca_topic_score_gemma":0.000005558338,"domain_scores_codex":[0.9982231,0.0002736732,0.0004741537,0.0004687695,0.0002469675,0.0003133011],"domain_scores_gemma":[0.9966432,0.0001993397,0.0001284919,0.002309232,0.0004320267,0.0002877078],"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.000002509166,0.0003281075,0.0002712935,0.00001283845,0.00005322753,8.902936e-7,0.00107003,0.8270149,0.0001011721,0.08133673,0.002735622,0.0870727],"study_design_scores_gemma":[0.0002613458,0.00003627309,0.002931711,0.00001478997,0.000005897933,0.00004084477,0.00005195855,0.9935857,0.000007934368,0.0006750228,0.002125261,0.0002632622],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.0001620844,0.0000405356,0.9763048,0.02010451,0.0001914367,0.0008518433,0.00002121225,0.0005357021,0.00178793],"genre_scores_gemma":[0.1968731,0.00002628052,0.801313,0.001081414,0.00002957753,0.0001995173,0.0004077147,0.00001341155,0.00005591186],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.196711,"threshold_uncertainty_score":0.9376893,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01744769911089912,"score_gpt":0.2480492258699638,"score_spread":0.2306015267590647,"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."}}