{"id":"W2154034366","doi":"10.1109/issse.2007.4294444","title":"Reducing Complexity Using Path Selection for Sequential Blind Beamforming for Wireless Communications","year":2007,"lang":"en","type":"article","venue":"","topic":"Advanced Adaptive Filtering Techniques","field":"Engineering","cited_by":3,"is_retracted":false,"has_abstract":true,"ca_institutions":"Institut National de la Recherche Scientifique","funders":"","keywords":"Computer science; Beamforming; Path (computing); Selection (genetic algorithm); Integer (computer science); Filter (signal processing); Power (physics); Computational complexity theory; Algorithm; Electronic engineering; Real-time computing; Telecommunications; Engineering; Artificial intelligence; Computer network","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.0003093126,0.0007643655,0.0002739297,0.000390209,0.0003641774,0.0003414555,0.0003593178,0.0004249466,0.002288788],"category_scores_gemma":[0.001090336,0.0002251655,0.0002865906,0.0003996466,0.0003244396,0.0006941447,0.0003713417,0.0004244868,0.0006657882],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002454525,"about_ca_system_score_gemma":0.0004106539,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0003841922,"about_ca_topic_score_gemma":0.001176369,"domain_scores_codex":[0.9997165,0.00008390042,0.0000160097,0.00004462777,0.00011769,0.00002126348],"domain_scores_gemma":[0.999436,0.0003321152,0.00006522396,0.00007982367,0.0000764029,0.0000105516],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0003614093,0.00006798318,0.0006951931,0.0002692887,0.0000704426,0.0001983733,0.0001451724,0.058095,0.4250619,0.01953169,0.001302388,0.4942012],"study_design_scores_gemma":[0.0001189931,0.001064216,0.001755485,0.00005535031,0.0001250116,0.001791918,0.00005753134,0.6598752,0.2896211,0.01851212,0.02694419,0.0000789121],"study_design_candidate":"not_applicable","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.008447217,0.0002164279,0.9904108,0.00006249182,0.00001871676,0.00002419324,0.00001068634,0.0002448799,0.0005646143],"genre_scores_gemma":[0.1926814,0.0005030371,0.8045233,0.00009648644,0.0000580628,0.00007590344,0.00004251715,0.00004708432,0.00197227],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002288788,"threshold_uncertainty_score":0.007656753,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1435081426239836,"score_gpt":0.3635198713604159,"score_spread":0.2200117287364323,"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."}}