{"id":"W1999993900","doi":"10.1007/s10479-011-0983-3","title":"An efficient memetic algorithm for the graph partitioning problem","year":2011,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":68,"is_retracted":false,"has_abstract":false,"ca_institutions":"Polytechnique Montréal","funders":"","keywords":"Memetic algorithm; Crossover; Graph partition; Tabu search; Theory of computation; Computer science; Partition (number theory); Mathematical optimization; Vertex (graph theory); Graph; Operator (biology); Algorithm; Mathematics; Local search (optimization); Theoretical computer science; Combinatorics; 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":[],"consensus_categories":[],"category_scores_codex":[0.001202923,0.00005816322,0.00007330772,0.0001621611,0.0002889748,0.00005355705,0.0002204253,0.00003806523,0.00008303539],"category_scores_gemma":[0.00003301184,0.00004283642,0.00004252242,0.0003134352,0.00009213248,0.0001050701,0.00001606404,0.0001264926,0.000008248219],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000005912706,"about_ca_system_score_gemma":0.00002461622,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001050349,"about_ca_topic_score_gemma":0.00002964633,"domain_scores_codex":[0.9992294,0.00006272864,0.0001656778,0.0001001503,0.000201854,0.0002401826],"domain_scores_gemma":[0.9991231,0.00008397788,0.000005315881,0.0002553157,0.0004830297,0.00004924818],"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.00002849236,0.0009361677,0.0001076322,0.0002232886,0.0003217211,0.000005417849,0.01157872,0.3523674,0.05111108,0.09277878,0.02786426,0.462677],"study_design_scores_gemma":[0.00007189998,0.0002685682,0.0002333571,0.00002344878,0.00000514884,0.000001302508,0.000280186,0.8035454,0.1927314,0.001918901,0.0008393413,0.00008099098],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01820221,0.0006909059,0.9758065,0.0002322979,0.00004456684,0.001122236,0.00003954297,0.0001793429,0.003682409],"genre_scores_gemma":[0.9445738,0.0002558506,0.05436609,0.00001841217,0.00004194152,0.0006407353,0.00001088421,0.00001848092,0.00007381877],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9263716,"threshold_uncertainty_score":0.222259,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2813694063939959,"score_gpt":0.4229850109156691,"score_spread":0.1416156045216732,"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."}}