{"id":"W2094342687","doi":"10.1109/scc.2014.130","title":"QoS-aware Service Composition over Graphplan through Graph Reachability","year":2014,"lang":"en","type":"article","venue":"","topic":"Service-Oriented Architecture and Web Services","field":"Computer Science","cited_by":28,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Dijkstra's algorithm; Reachability; Computer science; Graph traversal; Quality of service; Graph; Shortest path problem; Theoretical computer science; Distributed computing; Mathematical optimization; 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.0002924374,0.0002705735,0.0002515317,0.000118873,0.0002631483,0.0001708642,0.00130347,0.0001152263,0.00006856032],"category_scores_gemma":[0.000002470242,0.000220847,0.0001250708,0.001102144,0.00003628251,0.0008220152,0.0003669802,0.0002153013,0.0001131089],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001935366,"about_ca_system_score_gemma":0.00002093208,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002549187,"about_ca_topic_score_gemma":0.001701149,"domain_scores_codex":[0.9979363,0.0001939326,0.0003110491,0.000712752,0.0004266137,0.0004193726],"domain_scores_gemma":[0.9981488,0.0001828799,0.0001111485,0.001245442,0.0001703585,0.0001413527],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001185459,0.0009570475,0.02238745,0.0007056549,0.000198524,0.00001774288,0.01768426,0.0009338313,0.01320064,0.9122446,0.004315812,0.02723589],"study_design_scores_gemma":[0.004713666,0.001055856,0.2127459,0.0003614873,0.0001336899,0.0001799263,0.0009527665,0.1569423,0.0356239,0.4107647,0.1731382,0.003387513],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2874842,0.00005148287,0.6751228,0.006452518,0.0009854306,0.0003305991,0.000009373756,0.001045826,0.02851781],"genre_scores_gemma":[0.957316,0.000006922604,0.02085208,0.02149133,0.0002209191,0.00001887931,0.00004905609,0.00001554157,0.00002921179],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.6698319,"threshold_uncertainty_score":0.9005877,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0085201592419699,"score_gpt":0.2270570002207127,"score_spread":0.2185368409787428,"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."}}