Results 171 to 180 of about 21,948 (228)
GESim: ultrafast graph-based molecular similarity calculation via von Neumann graph entropy. [PDF]
J CheminformShiokawa H, Ishida S, Terayama K.
europepmc +1 more source
A Thermodynamically Favoured Molecular Computer: Robust, Fast, Renewable, Scalable
Stérin T +4 more
europepmc +1 more source
Concurrent applicative implementations of nondeterministic algorithms
Computer Languages, 1983 In this paper we introduce a methodology for utilizing concurrency in place of backtracking in the implementation of nondeterministic algorithms. This is achieved in an applicative setting through the use of the Friedman-Wise multiprogramming primitive frons, and a paradigm which views the action of nondeterministic algorithms as one of data structure ...
Richard Salter
openalex +2 more sources
Identical transformations in algebras of nondeterministic algorithms. I
Cybernetics, 1986 This paper is the first attempt to study the question of completeness of systems of axioms in the algebra of algorithms which, in addition to closed elementary logical conditions, also allows a nondeterministic operation on operators. For algebras of nondeterministic algorithms with closed logical conditions, the so-called S(H)-algebras, we construct a
Yu. A. Yushchenko
openalex +2 more sources
Is Your Graph Algorithm Eligible for Nondeterministic Execution?
2015 44th International Conference on Parallel Processing, 2015 Graph algorithms are used to implement data mining tasks on graph data-sets. Besides conducting the algorithms by the default deterministic manner, some graph processing frameworks, especially those supporting asynchronous execution model, provide interfaces for the algorithms to be executed in nondeterministic manner, which can improve the scalability
Zhiyuan Shao +4 more
openalex +2 more sources
, 2020 In this chapter, we consider bounds on the minimum complexity, an approach to proof of lower bounds, and algorithms for construction of nondeterministic and strongly nondeterministic decision trees. The bounds on complexity are true for arbitrary complexity functions.
Mikhail Moshkov
openalex +2 more sources
Some algorithms for equivalent transformation of nondeterministic finite automata
Russian Mathematics, 2009 zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Boris Melnikov, M. R. Saifullina
openalex +3 more sources
Cybernetics, 1983 Ever-increasing attention to the investigation of nondeterministic processes that generalize deterministic processes because of elimination of the rigidity of execution inherent in the latter is characteristic of modern programming. Nondeterminism reflects the crux of the sampling problem in tasks allowing multivaluedness of solutions such as ...
Yu. A. Yushchenko
openalex +3 more sources