Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,608,877 papers from all fields of science
Search
Sign In
Create Free Account
Unbounded nondeterminism
Known as:
Fair nondeterminism
, Unbounded indeterminacy
In computer science, unbounded nondeterminism or unbounded indeterminacy is a property of concurrency by which the amount of delay in servicing a…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
31 relations
Actor model
Actor model and process calculi
Actor model theory
Andrew D. Gordon
Expand
Broader (1)
Denotational semantics
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2010
2010
BIRATIONAL UNBOUNDEDNESS OF LOG TERMINAL Q-FANO VARIETIES AND RATIONALLY CONNECTED STRICT MORI FIBER SPACES
Takuzo Okada
,
Takuzo Okada
2010
Corpus ID: 2599825
In this paper, we show that (Q-factorial and log terminal) Q-Fano varieties with Picard number one are birationally unbounded in…
Expand
2009
2009
FITTING DISCRETE MULTIVARIATE DISTRIBUTIONS WITH UNBOUNDED MARGINALS AND NORMAL-COPULA DEPENDENCE
M. Rossetti
,
R. R. Hill
,
B. Johansson
,
A. Dunkin
,
R. G. Ingalls
2009
Corpus ID: 40124782
In specifying a multivariate discrete distribution via the the NORmal To Anything (NORTA) method, a problem of interest is: given…
Expand
2004
2004
The join problem in dynamic network algorithms
K. Konwar
,
D. Kowalski
,
Alexander A. Shvartsman
International Conference on Dependable Systems…
2004
Corpus ID: 13963230
Distributed algorithms in dynamic networks often employ communication patterns whose purpose is to disseminate information among…
Expand
2000
2000
Convergence analysis of the sign algorithm without the independence and gaussian assumptions
E. Eweda
IEEE Transactions on Signal Processing
2000
Corpus ID: 30193016
The paper is concerned with rigorous convergence analysis of the sign algorithm (SA) in the context of adaptive plant…
Expand
2000
2000
Efficient Linear Unboundedness Testing: Algorithm and Applications to Translational Assembly Planning
F. Schwarzer
,
A. Schweikard
,
Leo Joskowicz
Int. J. Robotics Res.
2000
Corpus ID: 17699343
We address the problem of efficiently testing for linear unboundedness and its applications to translational assembly planning…
Expand
1999
1999
A Global Convergence Theory for Dennis, El-Alem, and Maciel's Class of Trust-Region Algorithms for Constrained Optimization without Assuming Regularity
M. El-Alem
SIAM Journal on Optimization
1999
Corpus ID: 455589
This work presents a convergence theory for Dennis, El-Alem, and Maciel's class of trust-region-based algorithms for solving the…
Expand
1998
1998
Verifying Determinism of Concurrent Systems Which Use Unbounded Arrays
B. Roscoe
1998
Corpus ID: 8851907
Our main result says that determinism of a concurrent system which uses unbounded arrays (i.e. memories) can be veriied by…
Expand
1991
1991
Classification-based phrase structure grammar: an extended revised version of HPSG
R. Cooper
1991
Corpus ID: 125515394
This thesis is concerned with a presentation of Classification -based Phrase Structure Grammar (or cPSG), a grammatical theory…
Expand
1988
1988
A Category-theoretic Semantics for Unbounded Indeterminacy
P. Panangaden
,
J. R. Russell
Mathematical Foundations of Programming Semantics
1988
Corpus ID: 45433114
In this paper we give a category-theoretic semantics for a simple imperative language featuring unbounded indeterminacy. This…
Expand
1981
1981
An operational semantics for bounded nondeterminism equivalent to a denotational one : (preprint)
R. Kuiper
1981
Corpus ID: 116806687