{"id":"W2169947777","doi":"","title":"Dynamic coalition formation for efficient sleep time allocation in wireless sensor networks using cooperative game theory","year":2009,"lang":"en","type":"article","venue":"International Conference on Information Fusion","topic":"Distributed Control Multi-Agent Systems","field":"Computer Science","cited_by":9,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Wireless sensor network; Core (optical fiber); Computer science; Game theory; Mathematical optimization; Upper and lower bounds; Cramér–Rao bound; Wireless; Time allocation; Regular polygon; Convex optimization; Sleep (system call); Cooperative game theory; Algorithm; Computer network; Mathematics; Telecommunications; Estimation theory; Mathematical economics","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.0007774034,0.0002212038,0.0002092403,0.0004536815,0.0001394064,0.000463722,0.0005501572,0.0001406125,0.00003229702],"category_scores_gemma":[0.0001214888,0.0002169095,0.00007426451,0.0003079927,0.00002487692,0.00238884,0.00005653569,0.0001587623,0.0001096747],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005798422,"about_ca_system_score_gemma":0.00008633257,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001147583,"about_ca_topic_score_gemma":0.000004362304,"domain_scores_codex":[0.9979997,0.0001562917,0.0007851378,0.0002492979,0.0005343027,0.0002752472],"domain_scores_gemma":[0.9981418,0.0001292973,0.0004973481,0.0002719796,0.0008901075,0.00006946787],"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.0003008145,0.0001513928,0.0000110579,0.00001612852,0.00001848253,0.000001392099,0.001405004,0.4991522,0.007599713,0.438185,0.00007940301,0.0530794],"study_design_scores_gemma":[0.001460945,0.0001361964,0.0007167884,0.0001794622,0.000005399759,0.00001040455,0.0001994472,0.995137,0.000612464,0.001131014,0.0001812735,0.0002295514],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.04996186,0.000005249139,0.9449989,0.001176942,0.0005873345,0.001003442,0.00005837236,0.0001341915,0.002073711],"genre_scores_gemma":[0.996048,0.000009328447,0.002220742,0.0005775216,0.00004076443,0.00007238913,0.0009626166,0.000005783113,0.00006288792],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9460861,"threshold_uncertainty_score":0.8845313,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01782303886407323,"score_gpt":0.2714272445092342,"score_spread":0.253604205645161,"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."}}