{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002134271,0.001462363,0.002250794,0.001231626,0.001070317,0.002395388,0.004286034,0.001842352,0.007233113],"category_scores_gemma":[0.005280467,0.001427625,0.001539784,0.003562548,0.001181338,0.002663441,0.002739686,0.001790326,0.0007226118],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001733269,"about_ca_system_score_gemma":0.002738411,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.01143605,"about_ca_topic_score_gemma":0.01468138,"domain_scores_codex":[0.9981788,0.0006476608,0.00006844768,0.0003584238,0.0005239762,0.0002227761],"domain_scores_gemma":[0.9980143,0.001180843,0.0001557076,0.0002171104,0.0003319361,0.0000999766],"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.00002467276,0.00003345066,0.00008545526,0.00004597673,0.00003395631,0.00003300594,0.00003524727,0.9666339,0.0005237416,0.01585051,0.001304789,0.01539536],"study_design_scores_gemma":[0.000006902486,0.000008311161,0.00002179831,0.000002556961,0.000006543562,0.00000653662,0.000007936451,0.9946443,0.0001501321,0.00476748,0.0003737213,0.000003882938],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001825897,0.00008491167,0.9949853,0.0001428557,0.00002407804,0.00004863685,0.00006599414,0.0001254085,0.002696856],"genre_scores_gemma":[0.3068051,0.0004507976,0.6815454,0.0003423284,0.0001828999,0.0005295682,0.0004304903,0.0004077367,0.009305529],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01143605,"threshold_uncertainty_score":0.02419716,"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."}}