{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.00145518,0.0006926655,0.0009675568,0.0005182624,0.0006335664,0.0006704205,0.001399286,0.000669383,0.0005104048],"category_scores_gemma":[0.003289931,0.0003572731,0.0006718814,0.0005674628,0.000979717,0.001398953,0.001598409,0.0009132152,0.0001349081],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0007315633,"about_ca_system_score_gemma":0.001280513,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002684264,"about_ca_topic_score_gemma":0.002614803,"domain_scores_codex":[0.9992508,0.0003317875,0.00003772656,0.0001171646,0.0001859875,0.00007644879],"domain_scores_gemma":[0.9989428,0.0006329168,0.0001169351,0.00008096939,0.0001536026,0.00007280622],"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.00007900007,0.00005973028,0.0004453056,0.00006837617,0.00006221851,0.0001063351,0.0002840881,0.8785002,0.004564661,0.06677566,0.0008834178,0.04817096],"study_design_scores_gemma":[0.00001206453,0.00002939481,0.00004249135,0.000003665557,0.000006729709,0.00002157639,0.00001793268,0.9875816,0.0004775324,0.01132033,0.0004806248,0.000005989021],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.006924807,0.00007433152,0.9921666,0.00005469177,0.00001291319,0.0000277567,0.000005028148,0.00004009778,0.0006936843],"genre_scores_gemma":[0.6893997,0.0002844011,0.308028,0.00008656678,0.00003676222,0.0003125296,0.00005418368,0.0000458322,0.001752168],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.002684264,"threshold_uncertainty_score":0.007695794,"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."}}