{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.001015793,0.0002745586,0.0002875019,0.0008693889,0.0008879984,0.001040138,0.003774997,0.0001648768,0.00001319842],"category_scores_gemma":[0.00005829966,0.000280488,0.00006793038,0.0004963498,0.0006788175,0.006779806,0.004114879,0.0005423428,0.00018781],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001869169,"about_ca_system_score_gemma":0.0005630304,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001252334,"about_ca_topic_score_gemma":0.00001021412,"domain_scores_codex":[0.9979573,0.00003253004,0.0007155744,0.0003753336,0.0004974768,0.0004218053],"domain_scores_gemma":[0.996063,0.0004644794,0.000389073,0.002594708,0.0003539641,0.0001348057],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000006890934,0.00004930446,0.0001880633,0.00006514803,0.00001751935,9.034386e-7,0.003166085,0.02639603,0.000003666076,0.5790823,0.005699889,0.3853242],"study_design_scores_gemma":[0.0003560345,0.0000338584,0.0005055539,0.0002769905,0.000004722799,0.00001824878,0.00001372541,0.7277027,0.000002795438,0.0005685825,0.2702169,0.0002998472],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00003525562,0.001314459,0.8670754,0.0006936007,0.0006569563,0.0006702099,0.00002806352,0.0001723473,0.1293537],"genre_scores_gemma":[0.08077484,0.006962613,0.8966855,0.00375578,0.0002450173,0.0001671871,0.0004041476,0.0000535477,0.01095138],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.7013068,"threshold_uncertainty_score":0.9999969,"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."}}