{"id":"W2007979101","doi":"10.1016/s0022-0000(03)00075-8","title":"Solving large FPT problems on coarse-grained parallel machines","year":2003,"lang":"en","type":"article","venue":"Journal of Computer and System Sciences","topic":"Algorithms and Data Compression","field":"Computer Science","cited_by":114,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Victoria; Dalhousie University; Carleton University","funders":"","keywords":"Computer science; Vertex cover; Parallelism (grammar); Bounded function; Vertex (graph theory); Implementation; Cover (algebra); Sequence (biology); Parallel computing; Tree (set theory); Parallel algorithm; Algorithm; Theoretical computer science; Mathematics; Graph; Combinatorics; Approximation algorithm; Programming language","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.002373143,0.0001501679,0.0003044177,0.0002063673,0.0005155596,0.0005480775,0.0008435989,0.00003991002,0.000003079097],"category_scores_gemma":[0.00002218923,0.00009116226,0.00008175758,0.0003118013,0.00006677273,0.0008771485,0.0001534977,0.0001678139,0.000004737578],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002019279,"about_ca_system_score_gemma":0.00008952658,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0000060077,"about_ca_topic_score_gemma":0.000001416321,"domain_scores_codex":[0.9981098,0.0002499387,0.0004793132,0.0002743892,0.0006007084,0.0002858258],"domain_scores_gemma":[0.9989448,0.0001826958,0.0003823187,0.000212889,0.000124881,0.0001524378],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003402946,0.0005290747,0.008456799,0.0003515458,0.00010714,0.0003291575,0.005152564,0.01904068,0.0003640444,0.8509945,0.0148496,0.09979083],"study_design_scores_gemma":[0.0009251205,0.0008742666,0.001446885,0.0005684764,0.000007336855,0.001099792,0.0001883313,0.983655,0.00004183199,0.00206209,0.008894972,0.0002358876],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01319561,0.0008298297,0.9824403,0.0002472735,0.001432543,0.00009780414,0.000001656653,0.00003488854,0.001720124],"genre_scores_gemma":[0.8134448,0.00003114947,0.1860708,0.000183251,0.0002176875,0.000001343277,2.138218e-7,0.00000424784,0.00004653095],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.9646143,"threshold_uncertainty_score":0.5285124,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01946566761545364,"score_gpt":0.2503981644689971,"score_spread":0.2309324968535434,"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."}}