{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.001539269,0.001305331,0.001157067,0.00197716,0.001004596,0.001055459,0.00139068,0.001441224,0.01002031],"category_scores_gemma":[0.004693119,0.0007324978,0.0007623531,0.002488704,0.0008672308,0.001017086,0.0008320105,0.001105443,0.002004155],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056552,"about_ca_system_score_gemma":0.001937022,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.006618916,"about_ca_topic_score_gemma":0.006027246,"domain_scores_codex":[0.9991252,0.000481858,0.00003121646,0.00009507541,0.0001862829,0.00008043054],"domain_scores_gemma":[0.9985198,0.001017545,0.00007934894,0.00009071203,0.0002548718,0.00003763014],"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.0000980016,0.00007668422,0.0004650246,0.0001562642,0.0000724179,0.00005261219,0.0000845536,0.7269623,0.0009236211,0.01667937,0.009019411,0.2454098],"study_design_scores_gemma":[0.00005894151,0.00005396185,0.0000794368,0.0000225722,0.00001457819,0.00003304141,0.00001841717,0.9850281,0.0003486354,0.01103943,0.003294548,0.000008311185],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004913844,0.0005465025,0.9897876,0.0001109982,0.00004356683,0.0001328692,0.0001380082,0.001082509,0.003244062],"genre_scores_gemma":[0.06023403,0.0002951556,0.9356374,0.0001017727,0.00003641706,0.0005699602,0.0003809462,0.0002494328,0.002494873],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01002031,"threshold_uncertainty_score":0.03352129,"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."}}