{"id":"W2153797310","doi":"10.1109/jsac.2007.070110","title":"Adaptive energy conserving algorithms for neighbor discovery in opportunistic Bluetooth networks","year":2007,"lang":"en","type":"article","venue":"IEEE Journal on Selected Areas in Communications","topic":"Bluetooth and Wireless Communication Technologies","field":"Computer Science","cited_by":79,"is_retracted":false,"has_abstract":true,"ca_institutions":"Canada Research Chairs; University of Toronto","funders":"","keywords":"Computer science; Bluetooth; Neighbor Discovery Protocol; Wireless ad hoc network; Mobile ad hoc network; Energy consumption; Computer network; Context (archaeology); Node (physics); Distributed computing; Algorithm; Wireless; Telecommunications; The Internet; Network packet","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.001309802,0.0002470496,0.0003553241,0.0008488877,0.0004889987,0.0003164286,0.004887375,0.0002209936,0.000002092843],"category_scores_gemma":[0.0004422285,0.0002426055,0.00009802761,0.002034664,0.0001992867,0.0008061957,0.0004670705,0.001191495,0.000001675709],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0003708936,"about_ca_system_score_gemma":0.0004083685,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001053751,"about_ca_topic_score_gemma":0.001933127,"domain_scores_codex":[0.9975873,0.0003416198,0.0009011721,0.0003062675,0.0002519851,0.000611657],"domain_scores_gemma":[0.993664,0.002935959,0.0004793505,0.002362598,0.0004093995,0.0001487314],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000189556,0.001265461,0.003664035,0.000009281462,0.00009221002,0.00005442406,0.0006197953,0.006399549,0.0004192715,0.7326632,0.001622077,0.2530012],"study_design_scores_gemma":[0.002367291,0.0005494807,0.01736217,0.0005968456,0.00002101622,0.000201062,0.0006496506,0.929989,0.001133251,0.03722833,0.009065381,0.0008364727],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00335496,0.001242219,0.990209,0.003104842,0.0002883547,0.0002630336,0.00001013915,0.0001977372,0.001329756],"genre_scores_gemma":[0.9340979,0.002566598,0.06236104,0.0007114335,0.0000632499,0.0000836843,0.00002011835,0.00002413279,0.0000718856],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9307429,"threshold_uncertainty_score":0.9893167,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.05909783989474746,"score_gpt":0.3057080406750793,"score_spread":0.2466102007803318,"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."}}