{"id":"W244636295","doi":"10.1007/11945529_15","title":"Incremental Construction of k-Dominating Sets in Wireless Sensor Networks","year":2006,"lang":"en","type":"article","venue":"Lecture notes in computer science","topic":"Cooperative Communication and Network Coding","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Dominating set; Connected dominating set; Combinatorics; Vertex (graph theory); Monotone polygon; Discrete mathematics; Unit disk graph; Graph; Mathematics; Computer science; Set (abstract data type); Wireless sensor network; Wireless network; Wireless; Computer network; Telecommunications","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.001234193,0.0006727973,0.001316812,0.001055811,0.0009525919,0.001294437,0.003096717,0.00079089,0.002266265],"category_scores_gemma":[0.006480933,0.0008735837,0.001198735,0.001402931,0.0008599308,0.002623629,0.003837198,0.001238274,0.0004622403],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0008884658,"about_ca_system_score_gemma":0.001113813,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001237662,"about_ca_topic_score_gemma":0.002363884,"domain_scores_codex":[0.9986827,0.0004642049,0.0001028809,0.0002521536,0.0003403312,0.0001577643],"domain_scores_gemma":[0.9959124,0.002475318,0.0001842726,0.0006920745,0.0005210419,0.0002149081],"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.0006944324,0.0003097285,0.003097378,0.001060251,0.0001565569,0.0004163637,0.001016437,0.5273538,0.02022106,0.1218894,0.007071621,0.316713],"study_design_scores_gemma":[0.00005789505,0.0001317428,0.0006435803,0.00006131346,0.00005730717,0.0002023166,0.0002219806,0.8953958,0.006447411,0.09175737,0.004992101,0.00003125015],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.05591967,0.0003069842,0.9388279,0.0002766868,0.00006937258,0.0002139,0.0003385966,0.0005990008,0.003447939],"genre_scores_gemma":[0.3279751,0.0003558627,0.6679523,0.0001004187,0.00003777498,0.0003564502,0.0009320825,0.0001574881,0.002132476],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003096717,"threshold_uncertainty_score":0.007581413,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01418859862892893,"score_gpt":0.2589777498402869,"score_spread":0.2447891512113579,"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."}}