Search Results - deterministic AND nondeterministic algorithms*

Global Transformer Design Optimization Using Deterministic and Nondeterministic Algorithms by Amoiralis, Eleftherios I., Tsili, Marina A., Paparigas, Dimitrios G., Kladas, Antonios G.

“…This paper compares the application of two deterministic and three nondeterministic optimization algorithms to global transformer design optimization (TDO…”
Get full text

Deterministic Versus Nondeterministic Optimization Algorithms for the Restricted Boltzmann Machine by Zeng, Gengsheng L.

“… The Boltzmann machines are usually considered probability models. Probability models normally use nondeterministic algorithms to solve their parameters…”
Get full text

Holistic Review of UAV-Centric Situational Awareness: Applications, Limitations, and Algorithmic Challenges by MahmoudZadeh, Somaiyeh, Yazdani, Amirmehdi, Kalantari, Yashar, Ciftler, Bekir, Aidarus, Fathi, Al Kadri, Mhd Omar

“…This paper presents a comprehensive survey of UAV-centric situational awareness (SA), delineating its applications, limitations, and underlying algorithmic…”
Get full text

mlf-core: a framework for deterministic machine learning by Heumos, Lukas, Ehmele, Philipp, Kuhn Cuellar, Luis, Menden, Kevin, Miller, Edmund, Lemke, Steffen, Gabernet, Gisela, Nahnsen, Sven

“… Solely fixing all random seeds is not sufficient for deterministic machine learning, as major machine learning libraries default to the usage of nondeterministic algorithms based on atomic operations…”
Get full text

Incremental NFA minimization by Bianchini, Christian, Policriti, Alberto, Riccardi, Brian, Romanello, Riccardo

“… After dealing with the deterministic case, we extend this idea to the bisimulation-minimization of nondeterministic automata…”
Get full text

Efficient determinization of visibly and height-deterministic pushdown automata by Polách, Radomír, Trávníček, Jan, Janoušek, Jan, Melichar, Bořivoj

“…New algorithms for the determinization of nondeterministic visibly and nondeterministic real-time height-deterministic pushdown automata are presented…”
Get full text

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy by Kufleitner, Manfred, Wächter, Jan Philipp

“… More precisely, for every fixed variety in the Trotter-Weil Hierarchy, our approach yields an algorithm in nondeterministic logarithmic space (NL…”
Get full text

Computational complexity of the problem of tree generation under fine-grained access control policies by Moore, Neil

“…We consider the problem of deciding whether a fine-grained access control policy for tree updates allows a particular document to be constructed. This problem…”
Get full text

True random and adjustable memory management evaluation framework with Markov chain by Shahab, Alvin Syarifudin, Pramadihanto, Dadet, Sukaridhoto, Sritrustra, Widianjaya, Adhe

“… Nowadays there is a lot of memory management algorithm, and each algorithm has its own characteristics like the deterministic or nondeterministic algorithm…”
Get full text

Nearly Optimal Pseudorandomness From Hardness by Doron, Dean, Moshkovitz, Dana, Oh, Justin, Zuckerman, David

“… We convert randomized algorithms into deterministic ones with little slowdown. Specifically, assuming exponential lower bounds against randomized single-valued nondeterministic (SVN…”
Get full text

A Compositional Cost Model for the λ-calculus by Laird, James

“…[a].Although the natural semantics on which it is based is nondeterministic, our cost model is reasonable…”
Get full text

Winning Concurrent Reachability Games Requires Doubly-Exponential Patience by Hansen, K.A., Koucky, M., Miltersen, P.B.

“…We exhibit a deterministic concurrent reachability game PURGATORY n with n non-terminal positions and a binary choice for both players in every position so that any positional strategy for Player 1…”
Get full text

On efficient relabeling of symmetric discrete‐event systems by Jiao, Ting, Bai, Yu

“… Then by employing the subset construction algorithm (SCA), the resultant nondeterministic automaton is converted to its deterministic counterpart…”
Get full text

Concurrent Kleene algebra with tests and branching automata by Jipsen, Peter, Moshier, M. Andrew

Get full text

Efficient general AGH-unification by Liu, Zhiqiang, Lynch, Christopher

“… The general E-unification problem in this theory is NP-complete, and existing algorithms are highly nondeterministic…”
Get full text

From regular expressions to finite automata by Champarnaud, J.-M., Ponty, J.-L., Ziadi, D.

“… The Brzozowski algorithm yields a deterministic automaton, the Glushkov algorithm a nondeterministic one, and the general step by step method generally yields a NFA with ϵ-transitions…”
Get full text

On feasible cases of checking multi-agent systems behavior by Dekhtyar, Michael, Dikovsky, Alexander, Valiev, Mars

“… and are checked relative to the transition system induced by the multi-agent system definition. We show that there are deterministic or nondeterministic polynomial time check…”
Get full text

Time and space complexity of deterministic and nondeterministic decision trees by Moshkov, Mikhail

“… As algorithms for problem solving, we use deterministic and nondeterministic decision trees. As time and space complexity, we study the depth and the number of nodes in the decision trees…”
Get full text

Emergence in Interactive Embedded Art by Kuznetsov, Andrew V

“… Computational artwork is being considered in a new unconventional context. An aesthetic difference between the deterministic and nondeterministic algorithms was shown…”
Get full text

Editorial: P versus NP problem from Formal Languages Theory View by Ruiz-Vanoye, Jorge A, Díaz-Parra, Ocotlán, Trejo-Macotela, Francisco Rafael, Ramos-Fernández, Julio Cesar

“… P versus NP problem is to determine whether some deterministic algorithm also accepts every language accepted by some nondeterministic algorithm in polynomial time in polynomial time…”
Get full text