Computerized argument Delphi technique
SE Seker - IEEE Access, 2015 - ieeexplore.ieee.org
The aim of this study is the computerization of the argument Delphi method. The Delphi
method is mainly designed for qualitative prediction within a group of experts, where the …
method is mainly designed for qualitative prediction within a group of experts, where the …
[图书][B] Near rings, fuzzy ideals, and graph theory
B Satyanarayana, KS Prasad - 2013 - api.taylorfrancis.com
Near rings, fuzzy ideals, and graph theory is a very fascinating course. Near ring theory has
enormous applications in different subject areas such as digital computing, sequential …
enormous applications in different subject areas such as digital computing, sequential …
Analyzing CSP trustworthiness and predicting cloud service performance
R Maeser - IEEE Open Journal of the Computer Society, 2020 - ieeexplore.ieee.org
Analytics firm Cyence estimated Amazon's four-hour cloud computing outage in 2017 “cost
S&P 500 companies at least 150 million” and traffic monitoring firm Apica claimed “54 of the …
S&P 500 companies at least 150 million” and traffic monitoring firm Apica claimed “54 of the …
Hrotate: Hybrid relational rotation embedding for knowledge graph
Knowledge Graph represents the real world's information in the form of triplets (head,
relation, and tail). However, most Knowledge Graphs are highly incomplete. The goal of a …
relation, and tail). However, most Knowledge Graphs are highly incomplete. The goal of a …
Deadlock resolution in wait-for graphs by vertex/arc deletion
A deadlock occurs in a distributed computation if a group of processes wait indefinitely for
resources from each other. In this paper we study actions to be taken after deadlock …
resources from each other. In this paper we study actions to be taken after deadlock …
[PDF][PDF] Construction a topology on graphs
AHM Hamza, SNF Al-khafaji - Journal of Al-Qadisiyah for computer science …, 2013 - iasj.net
In this paper, we have constructed a topology on graphs and a topology on subgraphs with
examples. We proved that a graph is connected if, and only if, it is connected with respect to …
examples. We proved that a graph is connected if, and only if, it is connected with respect to …
[图书][B] A Model-Based Framework for Analyzing Cloud Service Provider Trustworthiness and Predicting Cloud Service Level Agreement Performance
RK Maeser III - 2018 - search.proquest.com
Abstract Analytics firm Cyence estimated Amazon's four-hour cloud computing outage on
February 28, 2017 “cost S&P 500 companies at least $150 million”(Condliffe 2017) and …
February 28, 2017 “cost S&P 500 companies at least $150 million”(Condliffe 2017) and …
[PDF][PDF] Star number of a graph
S Bhavanari, S Devanaboina… - Research Journal of …, 2016 - academia.edu
In this short paper, we considered simple graphs. We introduce the notions: star graph
generated by a vertex and star number of a graph. We provide some examples. We proved …
generated by a vertex and star number of a graph. We provide some examples. We proved …
HTransE: Hybrid Translation-based Embedding for Knowledge Graphs
Basically, a Knowledge Graph (KG) is a graph variant that represents data via triplets
comprising a head, a tail, and a relation. Realistically, most KGs are compiled either …
comprising a head, a tail, and a relation. Realistically, most KGs are compiled either …
Pseudo-von Neumann regular graph of commutative ring
Pseudo-Von Neumann Regular Graph of Commutative Ring Page 1 Journal of Physics:
Conference Series PAPER • OPEN ACCESS Pseudo-Von Neumann Regular Graph of …
Conference Series PAPER • OPEN ACCESS Pseudo-Von Neumann Regular Graph of …