{"id":"W2000612086","doi":"10.1007/s11761-013-0134-6","title":"Anytime QoS-aware service composition over the GraphPlan","year":2013,"lang":"en","type":"article","venue":"Service Oriented Computing and Applications","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":37,"is_retracted":false,"has_abstract":false,"ca_institutions":"Concordia University","funders":"","keywords":"Dijkstra's algorithm; Computer science; Quality of service; Graph; Mathematical optimization; Service (business); Process (computing); Algorithm; Shortest path problem; Theoretical computer science; Mathematics; Computer network","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.0001884354,0.0003208973,0.0002263341,0.0001438729,0.001160433,0.0004420649,0.001376098,0.000105836,0.00003242064],"category_scores_gemma":[0.000001220992,0.0002447416,0.0000651079,0.002345553,0.0000463948,0.0004353702,0.0006829802,0.0003423167,0.0002677261],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00002315146,"about_ca_system_score_gemma":0.00004162901,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001850724,"about_ca_topic_score_gemma":0.0002656551,"domain_scores_codex":[0.997925,0.0001135796,0.0003902498,0.0007238064,0.0003515199,0.0004958371],"domain_scores_gemma":[0.9977174,0.0002496667,0.0002172429,0.001115228,0.0004821361,0.0002182722],"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.00005711549,0.001799061,0.0145584,0.001592275,0.0008040601,0.00001448279,0.04638878,0.008880362,0.02864198,0.651082,0.007849579,0.2383319],"study_design_scores_gemma":[0.001946629,0.0001433789,0.09425526,0.0003185266,0.000142953,0.0002129686,0.004118351,0.7574874,0.001853483,0.01533684,0.122591,0.001593216],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4302449,0.0003902981,0.535927,0.02722602,0.0004511714,0.001897927,0.00002867311,0.00121653,0.002617489],"genre_scores_gemma":[0.9652753,0.00001907127,0.008044457,0.02574003,0.0004861469,0.0002490962,0.0001320506,0.00003129605,0.00002259582],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.748607,"threshold_uncertainty_score":0.9980275,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.005462421405902259,"score_gpt":0.222065093142707,"score_spread":0.2166026717368047,"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."}}