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.
2006
2006
Theoretical Foundations of Scope-Based Compensable Flow Language for Web Service
Web Services have become more and more important in these years, and BPEL4WS is a de facto standard for the web service… 
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… 
2000
2000
Exploiting non-determinism for reliability of mobile agent systems
An important technical hurdle blocking the adoption of mobile agent technology is the lack of reliability. Designing a reliable… 
2000
2000
Transparent consistent replication of Java RMI objects
The Java Remote Method Invocation (JRMI) specification simplifies the development of distributed Java applications, but provides… 
1999
1999
Reactivity in a Logic-Based Robot Programming Framework
A robot must often react to events in its environment and exceptional conditions by suspending or abandoning its current plan and… 
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… 
1992
1992
An object-oriented refinement calculus with modular reasoning
In this thesis, the refinement calculus is extended to support a variety of object-oriented programming styles. The late binding… 
1984
1984
Information Transfer under Different Sets of Protocols
We study four kinds of protocols in distributed computing. Besides the case of deterministic protocols, we consider random… 
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)