{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0009404896,0.0001705633,0.0003996487,0.000109766,0.0001356953,0.00006051104,0.0007107264,0.0001170611,8.595994e-7],"category_scores_gemma":[0.0000366416,0.0001013078,0.0000476256,0.0004745588,0.00008104681,0.0001629535,0.0004078555,0.000886419,0.000001939935],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00003231886,"about_ca_system_score_gemma":0.0000221633,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00000697667,"about_ca_topic_score_gemma":0.000002283867,"domain_scores_codex":[0.9985598,0.00005698996,0.0005394438,0.0002211265,0.0002878262,0.0003348098],"domain_scores_gemma":[0.9986444,0.0007121621,0.000277817,0.0001680189,0.00008896495,0.000108697],"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.00003503782,0.00009614112,0.002095557,0.00001417509,0.0002048607,0.00001301914,0.007435905,0.7100642,0.02473161,0.04597269,0.008016919,0.2013198],"study_design_scores_gemma":[0.003144033,0.0004850281,0.101245,0.0009960074,0.0001201112,0.0007267119,0.009883538,0.8700491,0.002771877,0.005483564,0.003728715,0.001366274],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2287817,0.002701952,0.7634836,0.004347687,0.0002243998,0.0001977236,2.338948e-7,0.00001483679,0.0002477857],"genre_scores_gemma":[0.9512563,0.001259822,0.0456326,0.001486425,0.0002953799,0.00001991916,6.514552e-8,0.000009036818,0.00004041038],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.7224746,"threshold_uncertainty_score":0.413121,"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."}}