{"id":"W1761185452","doi":"","title":"A Novel Method to Find the shortest Path in Wireless Networks","year":2013,"lang":"en","type":"article","venue":"Journal of academic and applied studies","topic":"Energy Efficient Wireless Sensor Networks","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Ant colony optimization algorithms; Shortest path problem; K shortest path routing; Wireless network; Economic shortage; Genetic algorithm; Wireless; Particle swarm optimization; Path (computing); Yen's algorithm; Algorithm; Mathematical optimization; Computer network; Dijkstra's algorithm; Mathematics; Machine learning; Theoretical computer science; Telecommunications","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0006004774,0.0008914613,0.0008709079,0.001976582,0.0009015,0.001042188,0.001401459,0.001068868,0.003032824],"category_scores_gemma":[0.001705929,0.0004145743,0.0009313595,0.001702677,0.0006750871,0.002660307,0.001024869,0.001182775,0.001065769],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005531107,"about_ca_system_score_gemma":0.001026647,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001430563,"about_ca_topic_score_gemma":0.001535267,"domain_scores_codex":[0.9993618,0.0001120997,0.00004204495,0.0001598185,0.0002907863,0.00003341605],"domain_scores_gemma":[0.9995039,0.0001820114,0.00004938784,0.00006110624,0.0001810831,0.00002246734],"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.0001273751,0.00009234491,0.0007785405,0.0009227771,0.000167538,0.0002902267,0.0003075963,0.1313533,0.02781903,0.1271246,0.01381421,0.6972024],"study_design_scores_gemma":[0.00007172764,0.0002112213,0.0004364173,0.00008717236,0.00007262125,0.001037682,0.0001335469,0.8711811,0.01314898,0.04575253,0.06777374,0.00009336392],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.001155038,0.000539478,0.9962187,0.0001026569,0.000209547,0.00004976115,0.00002983356,0.0002429731,0.00145202],"genre_scores_gemma":[0.04563898,0.001663246,0.9455404,0.0001626689,0.0002151487,0.0002639468,0.0001625319,0.0001689915,0.006183979],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.003032824,"threshold_uncertainty_score":0.01014584,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02546273039810615,"score_gpt":0.2898132040882628,"score_spread":0.2643504736901566,"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."}}