{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0007007605,0.0007478195,0.0009300497,0.001041146,0.000764481,0.000829862,0.001452176,0.001331167,0.003513575],"category_scores_gemma":[0.001630498,0.0003983234,0.0006695607,0.001004413,0.0005130033,0.0009380432,0.0009002931,0.0008505101,0.000500479],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0006232947,"about_ca_system_score_gemma":0.001084817,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001722356,"about_ca_topic_score_gemma":0.002739417,"domain_scores_codex":[0.9997041,0.0001119145,0.00001352227,0.00004329603,0.00008399144,0.00004321242],"domain_scores_gemma":[0.9995489,0.0002633849,0.00003437479,0.00004836102,0.00008037016,0.00002471427],"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.0002925199,0.0002511094,0.0005043678,0.0002008589,0.0001228592,0.0001607164,0.0001263435,0.6127664,0.006587296,0.03034098,0.009958427,0.3386881],"study_design_scores_gemma":[0.00009227756,0.0000747782,0.0001380284,0.0000128364,0.00002244713,0.00008292677,0.00002646152,0.9836321,0.0009113498,0.01238053,0.002617491,0.000008762067],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03969314,0.0007916242,0.9461948,0.0007724066,0.0002994026,0.0001710428,0.0001025691,0.0005033266,0.01147174],"genre_scores_gemma":[0.2460758,0.0004184265,0.7442639,0.0003044996,0.0001572657,0.0004080116,0.0002183107,0.0001116192,0.008042097],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003513575,"threshold_uncertainty_score":0.0117541,"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."}}