{"id":"W2155112903","doi":"10.1109/glsv.1991.143948","title":"An efficient tabu search algorithm for graph bisectioning","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":6,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Tabu search; Guided Local Search; Computer science; Graph; Algorithm; Set (abstract data type); Search algorithm; Hill climbing; Theoretical computer science; Mathematical optimization; 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.001191611,0.001416379,0.001732724,0.002772291,0.001440763,0.001833018,0.002178776,0.001663897,0.008312515],"category_scores_gemma":[0.004235192,0.0008812505,0.00105854,0.004605656,0.0009697764,0.00244135,0.00114861,0.001580425,0.002917937],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00170956,"about_ca_system_score_gemma":0.002354598,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007292525,"about_ca_topic_score_gemma":0.006514286,"domain_scores_codex":[0.9986759,0.0004905169,0.0000794654,0.0002159476,0.0004026552,0.0001356296],"domain_scores_gemma":[0.9983382,0.0007034364,0.0001355058,0.0002402808,0.0005352478,0.00004732277],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.0002768512,0.000168969,0.000626152,0.0003653499,0.0001359884,0.00007871913,0.000190768,0.3322282,0.006181296,0.03004545,0.01643061,0.6132717],"study_design_scores_gemma":[0.0001112479,0.00008764774,0.000178547,0.00003529276,0.00003159884,0.000111829,0.00004847598,0.965711,0.004627411,0.01914936,0.009873777,0.00003379209],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.004834234,0.0005489062,0.9891066,0.0001104013,0.00007346742,0.0001252408,0.000166625,0.002657525,0.002377103],"genre_scores_gemma":[0.04679032,0.000322864,0.9492086,0.00008652916,0.00003506559,0.0003241223,0.0006479666,0.0004198936,0.002164777],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.008312515,"threshold_uncertainty_score":0.02780819,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03160924119782899,"score_gpt":0.263572433394145,"score_spread":0.231963192196316,"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."}}