{"id":"W2170154411","doi":"10.1109/soac.1991.143848","title":"An efficient simulated annealing algorithm for graph bisectioning","year":2002,"lang":"en","type":"article","venue":"","topic":"Interconnection Networks and Systems","field":"Computer Science","cited_by":5,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Simulated annealing; Computer science; Algorithm; Adaptive simulated annealing; Graph; Random graph; Theoretical computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.0002600321,0.00009044012,0.0001051253,0.0001174929,0.0002914412,0.0002393191,0.000265982,0.00005377147,0.00004716785],"category_scores_gemma":[0.000007119565,0.00007787139,0.00007752475,0.0003565598,0.000009644545,0.0001974124,0.00002233806,0.00005704661,0.00001905469],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002329793,"about_ca_system_score_gemma":0.000003574366,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005212929,"about_ca_topic_score_gemma":0.000006146881,"domain_scores_codex":[0.9990974,0.00004052855,0.0002071645,0.0003005485,0.0001177805,0.0002365792],"domain_scores_gemma":[0.9993944,0.00006751606,0.00005177821,0.0002777308,0.0001308626,0.000077678],"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.000001337775,0.00008312969,0.00003541156,0.000004974282,0.00001941216,0.000002741349,0.0007818154,0.8767383,0.0001397335,0.01044893,0.001921233,0.109823],"study_design_scores_gemma":[0.0002395287,0.000126543,0.00001441129,0.00001001971,0.000001854098,0.00001339039,0.0000507583,0.9968465,0.0002883497,0.000138978,0.002152125,0.000117555],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.009346603,0.00005736449,0.9870029,0.00007585745,0.00163109,0.000185693,9.091227e-7,0.0003624835,0.001337096],"genre_scores_gemma":[0.9482864,0.00000166507,0.05056779,0.0001903197,0.0002418,0.00001112558,0.000001521139,0.000008341603,0.0006911117],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9389398,"threshold_uncertainty_score":0.3175503,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02459489648272742,"score_gpt":0.2534859118683615,"score_spread":0.2288910153856341,"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."}}