{"id":"W2074266386","doi":"10.1109/ccece.2008.4564610","title":"ε -Optimal approximation scheme for on-demand multipath routing in Ad hoc networks","year":2008,"lang":"en","type":"article","venue":"Conference proceedings - Canadian Conference on Electrical and Computer Engineering","topic":"Mobile Ad Hoc Networks","field":"Computer Science","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Computer science; Ad hoc On-Demand Distance Vector Routing; Computer network; Wireless ad hoc network; Distance-vector routing protocol; Optimized Link State Routing Protocol; Destination-Sequenced Distance Vector routing; Routing protocol; Dynamic Source Routing; Wireless Routing Protocol; Limiting; Network packet; Distributed computing; Telecommunications; Wireless; Engineering","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.001126486,0.0003742549,0.0005431699,0.0005379456,0.0005830145,0.0008441749,0.00127326,0.0006706828,0.001140585],"category_scores_gemma":[0.005276446,0.0001621614,0.0003497045,0.0005527204,0.0006373118,0.001093417,0.0008195505,0.0006697783,0.00022435],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001369447,"about_ca_system_score_gemma":0.001150881,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003686336,"about_ca_topic_score_gemma":0.002416829,"domain_scores_codex":[0.9990432,0.0002524995,0.0000418767,0.00007290455,0.0004752977,0.0001141275],"domain_scores_gemma":[0.9987133,0.0004987549,0.0001494811,0.0002561259,0.0003298173,0.00005250706],"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.0004928541,0.0001041203,0.00146428,0.0001315843,0.00005676319,0.0001762882,0.0001685406,0.7747092,0.01567509,0.07889579,0.00282246,0.1253031],"study_design_scores_gemma":[0.00001594725,0.00007865294,0.0001155684,0.00000819423,0.00001022625,0.00009470659,0.0000240302,0.9894161,0.002257277,0.006670817,0.001298733,0.000009767606],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.07291604,0.0004712986,0.9207919,0.0003277404,0.0001167712,0.00008411262,0.00006739194,0.0003630728,0.004861677],"genre_scores_gemma":[0.8111789,0.0004117212,0.1858428,0.00006887917,0.00004310698,0.00008343048,0.0001217194,0.00003923479,0.0022103],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003686336,"threshold_uncertainty_score":0.009936094,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02266715873121872,"score_gpt":0.2094686368479869,"score_spread":0.1868014781167682,"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."}}