{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0005856036,0.0009134959,0.0004805349,0.001304198,0.0008571693,0.001066323,0.0006023389,0.0006822694,0.002338177],"category_scores_gemma":[0.00171994,0.0004329396,0.001204988,0.001170902,0.001010728,0.001787486,0.0009308662,0.0008161312,0.0003058474],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001074879,"about_ca_system_score_gemma":0.001899873,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0124248,"about_ca_topic_score_gemma":0.01074951,"domain_scores_codex":[0.9993975,0.0001920116,0.0000295321,0.000130781,0.0001836859,0.00006638307],"domain_scores_gemma":[0.999171,0.0005674743,0.0000740554,0.00007449173,0.00007983958,0.00003319973],"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.0001400604,0.0001072807,0.0009472422,0.0002835507,0.00006875057,0.0003929074,0.0002985801,0.8019857,0.01887896,0.06075886,0.001955228,0.1141829],"study_design_scores_gemma":[0.00002250937,0.00003242595,0.0001544922,0.00001998745,0.00003206636,0.00008683296,0.00005584734,0.9486818,0.006730915,0.04104916,0.003118138,0.00001578912],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01632755,0.0001130175,0.9785935,0.0001329479,0.00001738634,0.0001190449,0.0001285319,0.001857259,0.002710732],"genre_scores_gemma":[0.3032722,0.0004209865,0.6927779,0.0000816262,0.00001811887,0.0002452015,0.0007059846,0.0002989826,0.002179072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.0124248,"threshold_uncertainty_score":0.02470493,"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."}}