{"id":"W2984916732","doi":"10.1007/978-3-030-34866-3_1","title":"Optimal VNF Placement: Addressing Multiple Min-Cost Solutions","year":2019,"lang":"en","type":"book-chapter","venue":"Communications in computer and information science","topic":"Software-Defined Networks and 5G","field":"Computer Science","cited_by":3,"is_retracted":false,"has_abstract":false,"ca_institutions":"Carleton University","funders":"","keywords":"Computer science; Heuristic; Integer programming; Quality of service; Virtual network; Linear programming; Function (biology); Mathematical optimization; Computer network; Distributed computing; Algorithm; Mathematics; Artificial intelligence","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.0005510912,0.001539659,0.001077743,0.0008179001,0.0006648521,0.001336144,0.001869706,0.001669386,0.01001763],"category_scores_gemma":[0.001999243,0.0006546077,0.0006066933,0.0016167,0.0003746122,0.00150259,0.001072564,0.001074069,0.001091792],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009567222,"about_ca_system_score_gemma":0.0009186964,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002686322,"about_ca_topic_score_gemma":0.005961786,"domain_scores_codex":[0.9995528,0.0001024898,0.00001532926,0.0000837171,0.0001429671,0.0001026427],"domain_scores_gemma":[0.9996645,0.0001665447,0.0000365756,0.0000387692,0.00007075147,0.00002279789],"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.0001408596,0.00009385583,0.0002221018,0.0003704558,0.00006491551,0.000145139,0.00007428297,0.6054498,0.003891279,0.05078293,0.02586574,0.3128987],"study_design_scores_gemma":[0.00001785734,0.00005784472,0.0001241772,0.00005484902,0.00002164581,0.0001861651,0.00005055764,0.9470215,0.001229968,0.04144401,0.009778885,0.00001248448],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01250695,0.001711579,0.9536924,0.0005527327,0.0005055169,0.00007712562,0.0001497224,0.0004077732,0.0303962],"genre_scores_gemma":[0.2696202,0.002458469,0.6943864,0.000391113,0.0006809208,0.0001614068,0.0003863454,0.000518039,0.03139716],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01001763,"threshold_uncertainty_score":0.03351229,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0827849293168979,"score_gpt":0.296260141005065,"score_spread":0.2134752116881671,"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."}}