{"id":"W4399718769","doi":"10.1109/cdc56724.2024.10886085","title":"A Parallel in Time Algorithm Based on ParaExp for Optimal Control Problems","year":2024,"lang":"en","type":"preprint","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Université Laval","funders":"Mitacs; Institut national de recherche en informatique et en automatique (INRIA); Agence Nationale de la Recherche; City University of Hong Kong","keywords":"Computer science; Control (management); Algorithm design; Algorithm; Parallel computing; Artificial intelligence","routes":{"ca_aff":true,"ca_fund":true,"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":["metaepi_narrow"],"consensus_categories":[],"category_scores_codex":[0.001013777,0.0003615628,0.0004636194,0.0004586242,0.00005444294,0.0007646621,0.001455563,0.0003055759,0.0001173334],"category_scores_gemma":[0.00004506976,0.0003077063,0.0002284984,0.0003056619,0.00003874453,0.00010092,0.0007866205,0.0007166546,0.000358893],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001248749,"about_ca_system_score_gemma":0.0004805238,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003666328,"about_ca_topic_score_gemma":0.000005804171,"domain_scores_codex":[0.9972019,0.0001353016,0.0005117661,0.00107751,0.0005295643,0.0005439572],"domain_scores_gemma":[0.9985077,0.0002769424,0.0001011565,0.0008053569,0.0001414648,0.0001673795],"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.0000226317,0.0002023425,0.000006670786,0.000171156,0.00002833928,0.00001478644,0.0001437384,0.9745884,0.000005557117,0.008034838,0.005338521,0.01144304],"study_design_scores_gemma":[0.001671829,0.0002355302,0.000009248167,0.000248102,0.000007445624,0.000001288309,0.000002021687,0.9820821,0.00001613949,0.01241121,0.002952551,0.0003625249],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.00001346981,0.00008637049,0.985438,0.006264422,0.0003371035,0.002905783,0.00006408186,0.0004580882,0.004432634],"genre_scores_gemma":[0.005421262,0.00001726956,0.9824182,0.002016521,0.0001043488,0.002323213,0.00009831417,0.00004974457,0.007551146],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01108051,"threshold_uncertainty_score":0.9999375,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02152654923245095,"score_gpt":0.2756879759153146,"score_spread":0.2541614266828637,"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."}}