Skip to search formSkip to main contentSkip to account menu

Nondeterministic algorithm

Known as: Non-deterministic algorithm 
In computer science, a nondeterministic algorithm is an algorithm that, even for the same input, can exhibit different behaviors on different runs… 
Wikipedia (opens in a new tab)

Related topics

Related topics

49 relations
Advice (complexity)AlgorithmAsymptotic computational complexityCommunicating sequential processes

Broader (1)

Theory of computation

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2006
Highly Cited
2006
Improved Genetic Algorithms Based Path planning of Mobile Robot Under Dynamic Unknown Environment
Aiming at path planning of mobile robot under part of dynamic unknown environment, there are some shortages in the aspects of… 
2006
2006
A Better N-Best List: Practical Determinization of Weighted Finite Tree Automata
Ranked lists of output trees from syntactic statistical NLP applications frequently contain multiple repeated entries. This… 
Highly Cited
2005
Highly Cited
2005
Improving the real-time behavior of ethernet networks using traffic smoothing
In modern process control systems, Ethernet is achieving a leading position, proposing itself as a network capable of supporting… 
2003
2003
Expressive Equivalence of Formalisms for Planning with Sensing
There have been several proposals for expressing planning problems with different forms of uncertainty, including non-determinism… 
Highly Cited
2002
Highly Cited
2002
Instruction stream mutation for non-deterministic processors
Differential power analysis (DPA) has become a real-world threat to the security of cryptographic hardware devices such as smart… 
2002
2002
Tracing externalities as sources of indeterminacy
Highly Cited
1998
Highly Cited
1998
The iconic page in manuscript, print, and digital culture
Introduction / George Bornstein and Theresa Tinkle -- Alfred the Great's burn Boethius / Kevin Kiernan -- Sensations of the page… 
Highly Cited
1993
Highly Cited
1993
FASTUS: A System for Extracting Information from Text
FASTUS is a (slightly permuted) acronym for Finite State Automaton Text Understanding System. It is a system for extracting… 
Highly Cited
1991
Highly Cited
1991
Goethe : the poet and the Age
Part 1 Germany in the 18th century: the age of Goethe? princes, pietists and professors the literary context to 1770. Part 2… 
1989
1989
Multiparty Interactions for Interprocess Communication and Synchronization
The authors consider the essential properties of a multiparty interaction construct which serves as a primitive for interprocess… 
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)