Results 171 to 180 of about 20,622 (217)
Deterministic Decisions in Non-deterministic Parsing [PDF]
, 2015 Jaf, Sardar, Ramsay, Allan
openaire
Some of the next articles are maybe not open access.
Related searches:
Related searches:
Journal of Algorithms, 2001
Summary: It is shown that a static dictionary that offers constant-time access to \(n\) elements with \(w\)-bit keys and occupies \(O(n)\) words of memory can be constructed deterministically in \(O(n\log n)\) time on a unit-cost RAM with word length \(w\) and a standard instruction set including multiplication.
Hagerup, Torben +2 more
openaire +3 more sources
Summary: It is shown that a static dictionary that offers constant-time access to \(n\) elements with \(w\)-bit keys and occupies \(O(n)\) words of memory can be constructed deterministically in \(O(n\log n)\) time on a unit-cost RAM with word length \(w\) and a standard instruction set including multiplication.
Hagerup, Torben +2 more
openaire +3 more sources
Deterministic and non-deterministic stable models
Journal of Logic and Computation, 1997zbMATH Open Web Interface contents unavailable due to conflicting licenses.
SACCA', Domenico, Zaniolo C.
openaire +3 more sources
Information Processing Letters, 2004
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. A. Harvey, J. Ian Munro
openaire +1 more source
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nicholas J. A. Harvey, J. Ian Munro
openaire +1 more source
2019 Forum for Specification and Design Languages (FDL), 2019
Actors have become widespread in programming languages and programming frameworks focused on parallel and distributed computing. While actors provide a more disciplined model for concurrency than threads, their interactions, if not constrained, admit nondeterminism. As a consequence, actor programs may exhibit unintended behaviors and are less amenable
Marten Lohstroh, Edward A. Lee
openaire +1 more source
Actors have become widespread in programming languages and programming frameworks focused on parallel and distributed computing. While actors provide a more disciplined model for concurrency than threads, their interactions, if not constrained, admit nondeterminism. As a consequence, actor programs may exhibit unintended behaviors and are less amenable
Marten Lohstroh, Edward A. Lee
openaire +1 more source
ACM Computing Surveys, 2015
Deterministic replay is a type of emerging technique dedicated to providing deterministic executions of computer programs in the presence of nondeterministic factors. The application scopes of deterministic replay are very broad, making it an important research topic in domains such as computer architecture, operating systems, parallel computing ...
Yunji Chen
exaly +2 more sources
Deterministic replay is a type of emerging technique dedicated to providing deterministic executions of computer programs in the presence of nondeterministic factors. The application scopes of deterministic replay are very broad, making it an important research topic in domains such as computer architecture, operating systems, parallel computing ...
Yunji Chen
exaly +2 more sources
Health Physics, 2001
Deterministic effects are distinguished from stochastic effects for radiation protection purposes by the following characteristics: both incidence and severity increase as a function of dose after a threshold dose is reached. Cell killing is central to all deterministic effects with the exception of radiation-induced cataracts.
openaire +2 more sources
Deterministic effects are distinguished from stochastic effects for radiation protection purposes by the following characteristics: both incidence and severity increase as a function of dose after a threshold dose is reached. Cell killing is central to all deterministic effects with the exception of radiation-induced cataracts.
openaire +2 more sources
DETERMINISTIC AND NON-DETERMINISTIC ASYNCHRONOUS AUTOMATIC STRUCTURES
International Journal of Algebra and Computation, 1992Following the definition of asynchronous automatic structures in [3], we define non-deterministic asynchronous automatic structures and characterize these in terms of the asynchronous fellow traveller property. We show that any group with a non-deterministic asynchronous automatic structure has an asynchronous automatic structure.
openaire +2 more sources
Deterministic and non-deterministic hypersubstitutions for algebraic systems
Asian-European Journal of Mathematics, 2016Hypersubstitutions for algebraic systems are mappings which send operation symbols to terms and relational symbols to formulas preserving arities (see [D. Phusanga, Derived Algebraic Systems, Ph.D. thesis, Potsdam (2013)]). In the non-deterministic case, i.e.
Joomwong, Jintana, Phusanga, Dara
openaire +1 more source
Non-deterministic languages to express deterministic transformations
Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, 1990The use of non-deterministic database languages is motivated using pragmatic and theoretical considerations. It is shown that non-determinism resolves some difficulties concerning the expressive power of deterministic languages: there are non-deterministic languages expressing low complexity classes of queries/updates, whereas no such deterministic ...
Serge Abiteboul +2 more
openaire +1 more source