{"id":"W2149504570","doi":"10.1108/02644400310502973","title":"Subdomain cluster generation for domain decomposition methods using graph partitioning optimization","year":2003,"lang":"en","type":"article","venue":"Engineering Computations","topic":"VLSI and FPGA Design Techniques","field":"Engineering","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Domain decomposition methods; Graph partition; Computer science; Parallel computing; Decomposition; Cluster (spacecraft); Heuristic; Decomposition method (queueing theory); Software; Graph; Load balancing (electrical power); Domain (mathematical analysis); Mathematical optimization; Theoretical computer science; Mathematics; Finite element method; Chemistry; Engineering; Programming language","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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0004313946,0.0005683618,0.0004804142,0.0005457992,0.0004655766,0.0005169311,0.000447779,0.0003703245,0.002235304],"category_scores_gemma":[0.001144709,0.0002432173,0.0003071668,0.0004922933,0.000310836,0.000424342,0.0006085316,0.0005818316,0.0004802057],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0005494485,"about_ca_system_score_gemma":0.000764704,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001502499,"about_ca_topic_score_gemma":0.002695851,"domain_scores_codex":[0.9997994,0.00007201119,0.000007046911,0.0000307498,0.00007274187,0.00001805133],"domain_scores_gemma":[0.9997262,0.0001499941,0.00002662507,0.00003117489,0.00004975457,0.00001634241],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001366621,0.00007159274,0.0007612323,0.0001576248,0.00002133197,0.0000562224,0.0001195754,0.7367786,0.02319429,0.02925376,0.002456136,0.206993],"study_design_scores_gemma":[0.00001195028,0.00001816072,0.00007941959,0.000005652561,0.000003059392,0.0000151067,0.00001896006,0.9901827,0.003207651,0.004387733,0.002065873,0.000003696879],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01222209,0.00008162009,0.9853466,0.00005763997,0.00001337793,0.00004126979,0.00002418871,0.0001677723,0.002045497],"genre_scores_gemma":[0.178974,0.0001450935,0.8184426,0.00004155805,0.0000163036,0.0001879744,0.0001420925,0.0001908963,0.001859563],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.002235304,"threshold_uncertainty_score":0.00747782,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02363652411567258,"score_gpt":0.3066194756582761,"score_spread":0.2829829515426036,"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."}}