{"id":"W2751133927","doi":"","title":"A Tabu Search Algorithm for Access Network Design","year":2000,"lang":"en","type":"article","venue":"PolyPublie (École Polytechnique de Montréal)","topic":"Advanced Optical Network Technologies","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Polytechnique Montréal; Institut National de la Recherche Scientifique","funders":"","keywords":"Synchronous optical networking; Tabu search; Computer science; Hierarchy; Set (abstract data type); Transmission (telecommunications); Tree (set theory); Computer network; Distributed computing; Population; Variety (cybernetics); Network planning and design; Mathematical optimization; Algorithm; Telecommunications; Mathematics","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"],"consensus_categories":[],"category_scores_codex":[0.0005079323,0.0004378651,0.0004492639,0.000205658,0.0002528573,0.0002195135,0.001020003,0.0004550611,0.0001381005],"category_scores_gemma":[0.00006258066,0.0004579699,0.0001659494,0.0009122699,0.0001348085,0.0005072719,0.0001527754,0.000603896,0.00003783166],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000383848,"about_ca_system_score_gemma":0.00006254695,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000132687,"about_ca_topic_score_gemma":0.00008852085,"domain_scores_codex":[0.997272,0.00005615473,0.0004515203,0.0004601643,0.0002741767,0.001486031],"domain_scores_gemma":[0.9984293,0.0003742918,0.00004197425,0.0008245897,0.00006864168,0.0002612217],"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.00002656121,0.00002652236,0.0001083883,0.00001645512,0.00003415694,0.00001478599,0.00001161575,0.5453679,0.0001231932,0.001595692,0.008723355,0.4439513],"study_design_scores_gemma":[0.0004077483,0.0001246472,0.00046793,0.00004913521,0.00002460374,0.00003573835,0.00001632376,0.9664999,0.003380039,0.01145653,0.01701146,0.0005259516],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.002256976,0.00225156,0.9870313,0.0005637304,0.0001060377,0.001558697,0.00004019454,0.005417969,0.0007735462],"genre_scores_gemma":[0.02277178,0.001145548,0.9723785,0.0006147202,0.0003986193,0.001802569,0.00003144387,0.0001947823,0.0006620704],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.4434254,"threshold_uncertainty_score":0.9997872,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01811799580224435,"score_gpt":0.2523666907199298,"score_spread":0.2342486949176854,"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."}}