{"id":"W2087903459","doi":"10.1109/icc.2013.6654773","title":"Distributed algorithms for the RFID coverage problem","year":2013,"lang":"en","type":"article","venue":"","topic":"RFID technology advancements","field":"Engineering","cited_by":8,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Ottawa","funders":"","keywords":"Computer science; Greedy algorithm; Set cover problem; Cover (algebra); Algorithm; Distributed algorithm; Randomized algorithm; Set (abstract data type); Random access; Approximation algorithm; Theoretical computer science; Distributed computing","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.00003433862,0.00007952118,0.000065663,0.00001640631,0.00005258307,0.00001975394,0.0001636768,0.00005205307,0.0002273396],"category_scores_gemma":[0.00001259055,0.00005279472,0.00002331401,0.00008461905,0.00002327316,0.000113352,0.00002456298,0.00007554069,0.0001527825],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003012114,"about_ca_system_score_gemma":0.000002405628,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000009293347,"about_ca_topic_score_gemma":0.000003623001,"domain_scores_codex":[0.9995746,0.000001935869,0.0000995033,0.0000816519,0.00004856484,0.0001937344],"domain_scores_gemma":[0.9996832,0.00005994788,0.00001016859,0.0002007318,0.00002722941,0.00001872315],"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.000008657769,0.0001023409,0.002839326,0.0001658617,0.0005957369,0.000003477513,0.00010953,0.08997845,0.01818692,0.03023129,0.3602868,0.4974916],"study_design_scores_gemma":[0.001434509,0.00008078937,0.005612825,0.00001488826,0.00003092157,0.000007688412,0.00009005996,0.5460959,0.03701023,0.038438,0.3707332,0.0004509966],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.007195158,0.0001412811,0.9874455,0.0006902419,0.0001882014,0.0008725128,0.00003709205,0.0008131146,0.002616906],"genre_scores_gemma":[0.9660738,0.00007184688,0.03103048,0.0001312999,0.00004402111,0.001134073,0.00004633136,0.0000343422,0.001433767],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9588787,"threshold_uncertainty_score":0.2489209,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.008653263514696658,"score_gpt":0.2156531616614804,"score_spread":0.2069998981467837,"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."}}