Results 1 to 10 of about 21,948 (228)
The Nondeterministic Waiting Time Algorithm: A Review [PDF]
Electronic Proceedings in Theoretical Computer Science, 2009 We present briefly the Nondeterministic Waiting Time algorithm. Our technique for the simulation of biochemical reaction networks has the ability to mimic the Gillespie Algorithm for some networks and solutions to ordinary differential equations for ...
John Jack, Andrei Păun
doaj +8 more sources
Deterministic Versus Nondeterministic Optimization Algorithms for the Restricted Boltzmann Machine. [PDF]
J Comput Cogn EngA restricted Boltzmann machine is a fully connected shallow neural network. It can be used to solve many challenging optimization problems. The Boltzmann machines are usually considered probability models. Probability models normally use nondeterministic algorithms to solve their parameters.
Zeng GL.
europepmc +5 more sources
Nondeterministic functional transducer inference algorithm [PDF]
, 2020 The purpose of this paper is to present an algorithm for inferring nondeterministic functional transducers. It has a lot in common with other well known algorithms such has RPNI and OSTIA. Indeed we will argue that this algorithm is a generalisation of both of them.
Aleksander Mendoza-Drosik
openalex +3 more sources
Properties and Application of Nondeterministic Quantum Query Algorithms [PDF]
SPIE Proceedings, 2006 Many quantum algorithms can be analyzed in a query model to compute Boolean functions where input is given by a black box. As in the classical version of decision trees, different kinds of quantum query algorithms are possible: exact, zero-error, bounded-error and even nondeterministic. In this paper, we study the latter class of algorithms.
Alina Dubrovska
openalex +4 more sources
An algorithm to find optimal attack paths in nondeterministic scenarios [PDF]
Proceedings of the 4th ACM workshop on Security and artificial intelligence, 2011 ACM Workshop on Artificial Intelligence and Security (AISec 2011), at ACM CCS Conference ...
Carlos Sarraute +2 more
openalex +4 more sources
Nondeterministic Algorithms [PDF]
Journal of the ACM, 1967 Programs to solve combinatorial search problems may often be simply written by using multiple-valued functions. Such programs, although impossible to execute directly on conventional computers, may be converted in a mechanical way into conventional backtracking programs.
Robert W. Floyd
openalex +3 more sources
Electronic Proceedings in Theoretical Computer Science, 2015 Homing preset and adaptive experiments with Finite State Machines (FSMs) are widely used when a non-initialized discrete event system is given for testing and thus, has to be set to the known state at the first step.
Natalia Kushik, Nina Yevtushenko
doaj +6 more sources
Learning Markov Decision Processes for Model Checking [PDF]
Electronic Proceedings in Theoretical Computer Science, 2012 Constructing an accurate system model for formal model verification can be both resource demanding and time-consuming. To alleviate this shortcoming, algorithms have been proposed for automatically learning system models based on observed system ...
Hua Mao +5 more
doaj +4 more sources
Nondeterministic Query Algorithms [PDF]
, 2020 JUCS - Journal of Universal Computer Science Volume Nr.
Alina Vasilieva, Rūsiņš Freivalds
openalex +2 more sources
, 2018 Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\times n$ matrices can be performed in near-optimal nondeterministic time $\tilde{O}(n^2)$.
Marvin Künnemann
+9 more sources