| G.2.2 Graph Theory | Article |
CHOICE OF DIAGNOSTIC DECISION MAKING IN MEDICINE AND INTERVENTION MISTAKE ... |
Abstract: Most processes, found in medicine, are nonlinear, chaotic, have a high level of complexity. The
decisions in health care are often stereotyped, managed by habits preferences, previous exper |
| G.2.2 Graph Theory | Article |
CONVEXITY RELATED ISSUES FOR THE SET OF HYPERGRAPHIC SEQUENCES |
Abstract: We consider ܦ ,(݊)the set of all degree sequences of simple hypergraphs with ݊ vertices
and ݉ hyperedges. We show that ܦ ,(݊)which is a subset of the ݊-dimensional ݉+1-valued |
| G.2.2 Graph Theory | Article |
Criteria investigations in ant colony optimization algorithm for travelling ... |
Abstract: New ant colony optimization algorithm has been investigated. Optimal search tactic and ant decision
making criterion have been found.
Keywords: Ant colony optimization algorithm, travell |
| G.2.2 Graph Theory | Article |
CRITERIA INVESTIGATIONS IN ANT COLONY OPTIMIZATION ALGORITHM FOR TRAVELLING SALE |
Abstract: New ant colony optimization algorithm has been investigated. Optimal search tactic and ant decision
making criterion have been found.
Keywords: Ant colony optimization algorithm, travell |
| G.2.2 Graph Theory | Article |
INFORMATION FLOWS ENHANCEMENT FOR AIS TOURISM AUTOMATED INFORMATION SYSTEM |
Abstract: This article put emphasis on the issue of information system efficiency in tourism, as a tool of
defining the level of domestic and inbound tourism growth. The necessity of information syst |
| G.2.2 Graph Theory | Article |
INTERFERENCE MINIMIZATION IN PHYSICAL MODEL OF WIRELESS NETWORKS |
Abstract: Interference minimization problem in wireless sensor and ad-hoc networks is considered. That is to
assign a transmission power to each node of a network such that the network is connected a |
| G.2.2 Graph Theory | Article |
LOGARITHMIC DISTANCES IN GRAPHS |
Abstract: The walk distances in graphs are defined as the result of appropriate transformations of the
P1
k=0(tA)k
proximity measures, where A is the weighted adjacency matrix of a graph and t is a |
| G.2.2 Graph Theory | Article |
MODIFIED BRANCH AND BOUND ALGORITHM FOR SOLVING THE HAMILTONIAN RURAL ... |
Abstract: In this paper the Hamiltonian Rural Postman Problem is generalization of the Hamiltonian Travelling
Salesman Problem is described. The offered modification of a classical method (Little’s |
| G.2.2 Graph Theory | Article |
ONTOLOGY OF EDUCATIONAL STANDARDS |
Abstract: This article discusses the formation of educational standards. The method of forming the content of the
educational process describes. The method is based on the ontological knowledge repre |
| G.2.2 Graph Theory | Article |
THE IMPROVEMENT OF THE PROCESS OF PROVIDING GOVERMENT SERVICES IN MULTIFUNCTIONA |
Abstract: This paper solves the problem of the efficiency of multifunctional centers providing services
(MFC) in Russia. It is used the method of process modeling and improvement to business-processe |
Wiki
