{"id":"W2117244388","doi":"10.1109/icc.2005.1495076","title":"An adaptive scheduling algorithm for bluetooth ad-hoc networks","year":2005,"lang":"en","type":"article","venue":"","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Computer science; Piconet; Bluetooth; Computer network; Scheduling (production processes); Wireless ad hoc network; Scatternet; Maximum throughput scheduling; Distributed computing; Dynamic priority scheduling; Algorithm; Wireless; Round-robin scheduling; Mathematical optimization; Quality of service; Mathematics","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.0006541506,0.0004676148,0.0003516547,0.0006588315,0.0007294721,0.0004199531,0.0009825372,0.0003564597,0.001195003],"category_scores_gemma":[0.001718862,0.0001765826,0.0002424438,0.000567154,0.0003444408,0.000665292,0.0004471607,0.0005882907,0.0003354333],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0004710365,"about_ca_system_score_gemma":0.0006784704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001267957,"about_ca_topic_score_gemma":0.001604167,"domain_scores_codex":[0.9996098,0.0001119098,0.00002860146,0.00006664832,0.0001427189,0.00004039204],"domain_scores_gemma":[0.9995253,0.0001863399,0.00005566729,0.00006410763,0.0001363065,0.00003233559],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0003701932,0.0001618143,0.00179267,0.0001584287,0.00008329368,0.0001350847,0.0001922058,0.2964099,0.02795731,0.0440528,0.006450121,0.6222361],"study_design_scores_gemma":[0.00005429638,0.00009693464,0.0003279269,0.00001037908,0.00002057498,0.0001359417,0.00002693701,0.9752597,0.005655172,0.008863992,0.009528512,0.00001964535],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01157286,0.0002754721,0.9854804,0.00008723446,0.0001727419,0.00007084107,0.00002078956,0.0005202422,0.001799469],"genre_scores_gemma":[0.410374,0.0004386706,0.5852429,0.0001712957,0.0001993424,0.0002362762,0.0001444111,0.0001111367,0.00308194],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.001267957,"threshold_uncertainty_score":0.003997743,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02297641856061389,"score_gpt":0.2683557234745795,"score_spread":0.2453793049139656,"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."}}