{"id":"W3135615791","doi":"10.1155/2021/6641857","title":"An Improved Harmony Search Algorithm for Proactive Routing Protocol in VANET","year":2021,"lang":"en","type":"article","venue":"Journal of Advanced Transportation","topic":"Vehicular Ad Hoc Networks (VANETs)","field":"Engineering","cited_by":40,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Universiti Kebangsaan Malaysia","keywords":"Computer science; Harmony search; Computer network; Optimized Link State Routing Protocol; Vehicular ad hoc network; Quality of service; Routing protocol; Link-state routing protocol; Mobile ad hoc network; Distributed computing; Selection algorithm; Wireless ad hoc network; Routing (electronic design automation); Selection (genetic algorithm); Wireless; Machine learning; Artificial intelligence","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002988756,0.0001352002,0.0002429076,0.00009861411,0.00003224753,0.00002669128,0.00009085031,0.0000769251,0.000009585256],"category_scores_gemma":[0.0000116058,0.0001399446,0.00008987247,0.000236722,0.00001036314,0.0006830237,9.757414e-7,0.0003417208,3.762711e-7],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001295799,"about_ca_system_score_gemma":0.00009812829,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000002776528,"about_ca_topic_score_gemma":0.0001024848,"domain_scores_codex":[0.9988111,0.00003350182,0.0005410064,0.0001433062,0.0001999783,0.0002710699],"domain_scores_gemma":[0.9993352,0.00004479141,0.00012445,0.0001022831,0.0002968317,0.00009641196],"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.00009303139,0.00006816532,0.0001467309,0.00006969607,0.00003968376,0.00007173073,0.0008909498,0.8474981,0.04178282,0.00001104453,0.000006155018,0.1093219],"study_design_scores_gemma":[0.004113784,0.0003672141,0.02532254,0.0001567168,0.00003800761,0.00003287738,0.0009176639,0.9004458,0.06738096,0.0002292843,0.0007571764,0.0002380384],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3348898,0.0000826544,0.6449223,0.00005808017,0.000316597,0.01958449,0.00003782961,0.00007356329,0.0000347532],"genre_scores_gemma":[0.7245853,0.00001999857,0.2697499,0.00002704953,0.0003094708,0.005114159,0.0001040947,0.00007597102,0.00001408196],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.3896955,"threshold_uncertainty_score":0.5706775,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01002926919357028,"score_gpt":0.275668115265624,"score_spread":0.2656388460720537,"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."}}