{"id":"W1978104777","doi":"10.1109/ictai.2010.25","title":"An Effective Multilevel Memetic Algorithm for Balanced Graph Partitioning","year":2010,"lang":"en","type":"preprint","venue":"","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":10,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Angers Loire Métropole","keywords":"Memetic algorithm; Computer science; Operator (biology); Graph; Graph partition; Algorithm; Local search (optimization); Combinatorics; Mathematics; Theoretical computer science","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":false,"about_ca":true,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.0002339127,0.0003135222,0.0003512246,0.0001551429,0.00006524811,0.00008658046,0.0002516606,0.0005239006,0.00006408463],"category_scores_gemma":[0.00002184497,0.0003095082,0.0001652343,0.00005145687,0.0000319437,0.00009193396,0.00005480743,0.0006488648,0.000008473663],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00004566854,"about_ca_system_score_gemma":0.00001207488,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003754646,"about_ca_topic_score_gemma":0.00001949372,"domain_scores_codex":[0.9989634,0.00002602966,0.0002352906,0.0003671321,0.0001101442,0.0002979629],"domain_scores_gemma":[0.9991974,0.0001066512,0.00004373748,0.0004500358,0.0001008216,0.0001013257],"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.000005086072,0.00006829209,0.00004674459,0.0004139708,0.0001755773,0.000003614019,0.0002667834,0.005704511,0.04046785,0.000591188,0.001691632,0.9505647],"study_design_scores_gemma":[0.000270112,0.0000787575,0.0007343251,0.00009920981,0.00005174028,0.00000227945,0.00001232852,0.8165545,0.165316,0.01596043,0.0004209621,0.000499334],"study_design_candidate":"design_other","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.004782025,0.00008615481,0.9890131,0.000005653957,0.0007812641,0.001532382,0.0001418528,0.002378898,0.001278688],"genre_scores_gemma":[0.5448582,0.00003798631,0.452143,0.00002711109,0.0002603477,0.002365414,0.0001819378,0.00008268232,0.00004333105],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9500654,"threshold_uncertainty_score":0.9999357,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01115318513578614,"score_gpt":0.2622558178298913,"score_spread":0.2511026326941052,"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."}}