Results 1 to 10 of about 20,834 (163)

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 ...
A. Funahashi, A. Funahashi, A. V. Hill, Andrei Păun, Bianca Truthe, C. M. Guldberg, C. M. Guldberg, C. V. Rao, C. Zandron, D. A. McQuarrie, D. T. Gillespie, D. T. Gillespie, E. L. Haseltine, E. S. Lander et al., E. W. Montroll, F. Hua, G. Lahav, G. Paun, Giovanni Pighizzini, H. A. Kramers, J. Jack, J. Jack, J. Jack, J. Jack, J. M. G. Vilar, John Jack, Jürgen Dassow, K. Oda, L. M. Adleman, L. Wilhelmy, M. A. Gibson, M. Hucka et al., N. Selliah, P. Waage, R. L. Bar-Or, S. Cheruku   +35 more
core   +8 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   +4 more sources

Properties and application of nondeterministic quantum query algorithms [PDF]

SPIE Proceedings, 2007
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
  +7 more sources

Nondeterministic Query Algorithms [PDF]

, 2011
JUCS - Journal of Universal Computer Science Volume Nr.
Alina Vasilieva, Rūsiņš Freivalds
  +5 more sources

A Nondeterministic Minimization Algorithm [PDF]

, 1990
The problem of minimizing a multivariate function is recurrent in many disciplines as Physics, Mathematics, Engeneering and, of course, Computer Science. In this paper we describe a simple nondeterministic algorithm which is based on the idea of adaptive noise, and that proved to be particularly effective in the minimization of a class of multivariate,
Bruno Caprile, Federico Girosi
openalex   +3 more sources

Nondeterministic versus probabilistic linear search algorithms [PDF]

26th Annual Symposium on Foundations of Computer Science (sfcs 1985), 1985
The "component counting lower bound" known for deterministic linear search algorithms (LSA's) also holds for their probabilistic versions (PLSA's) for many problems, even if two-sided error is allowed, and if one does not charge for probabilistic choice. This implies lower bounds on PLSA's for e.g.
Friedhelm Meyer auf der Heide
openalex   +5 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, Gerardo Richarte, Jorge Lucángeli Obes   +2 more
openalex   +5 more sources

Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems [PDF]

Fuzzy Sets and Systems
Fuzzy transition systems offer a robust framework for modeling and analyzing systems with inherent uncertainties and imprecision, which are prevalent in real-world scenarios. As their extension, nondeterministic fuzzy transition systems (NFTSs) have been studied in a considerable number of works. Wu et al. (2018) provided an algorithm for computing the
Linh Anh Nguyen
  +5 more sources

Efficient Algorithms for Handling Nondeterministic Automata [PDF]

, 2011
Finite (word, tree, or omega) automata play an important role in different areas of computer science, including, for instance, formal verification. Often, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies
Tomáš Vojnar
openalex   +3 more sources

An Algorithm to Compute the Inverse Image of a Point With Respect to a Nondeterministic Max-Plus Linear System [PDF]

IEEE Transactions on Automatic Control, 2020
Max Plus Linear (MPL) systems are often described by a transition function, which models the state evolution of the system, and a measurement function, which binds the measures with the system states. Methods for computing the inverse image of a point w.r.t.
Renato Markele Ferreira Cândido, Laurent Hardouin, Mehdi Lhommeau, Rafael Santos Mendes   +3 more
openalex   +5 more sources