Výsledky vyhledávání - deterministic AND nondeterministic algorithm*

Global Transformer Design Optimization Using Deterministic and Nondeterministic Algorithms Autor 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…”
Získat plný text

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

“… The Boltzmann machines are usually considered probability models. Probability models normally use nondeterministic algorithms to solve their parameters…”
Získat plný text

Holistic Review of UAV-Centric Situational Awareness: Applications, Limitations, and Algorithmic Challenges Autor 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 challenges…”
Získat plný text

mlf-core: a framework for deterministic machine learning Autor 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…”
Získat plný text

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

“… Our algorithm builds upon Almeida et al. from 2014, fixing a minor mistake and generalizing it to the nondeterministic case…”
Získat plný text

Time and space complexity of deterministic and nondeterministic decision trees Autor 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…”
Získat plný text

Efficient determinization of visibly and height-deterministic pushdown automata Autor 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…”
Získat plný text

The Word Problem for Omega-Terms over the Trotter-Weil Hierarchy Autor 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…”
Získat plný text

Is Your Graph Algorithm Eligible for Nondeterministic Execution? Autor Shao, Zhiyuan, Hou, Lin, Ai, Yan, Zhang, Yu, Jin, Hai

“…Graph algorithms are used to implement data mining tasks on graph data-sets. Besides conducting the algorithms by the default deterministic manner, some graph…”
Získat plný text

A hybrid multiple-character transition finite-automaton for string matching engine Autor Chen, Chien-Chi, Wang, Sheng-De

“…[Display omitted] •A hybrid finite automaton is proposed with deterministic and nondeterministic parts…”
Získat plný text

Opacity Enforcing Supervisory Control Using Nondeterministic Supervisors Autor Xie, Yifan, Yin, Xiang, Li, Shaoyuan

“… In this article, we propose a new approach for enforcing opacity using nondeterministic supervisors…”
Získat plný text

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

“…[a].Although the natural semantics on which it is based is nondeterministic, our cost model is reasonable…”
Získat plný text

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

“… Then by employing the subset construction algorithm (SCA), the resultant nondeterministic automaton is converted to its deterministic counterpart…”
Získat plný text

Nearly Optimal Pseudorandomness From Hardness Autor 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…”
Získat plný text

Computational complexity of the problem of tree generation under fine-grained access control policies Autor 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…”
Získat plný text

Traffic-Aware Predictive Energy Optimization for Control- and User-Plane Separation Systems Autor Zhao, Heng, Zhao, Liqiang, Pang, Lihua, Chu, Xiaoli, Zhou, Guorong, Liu, Jiaxin

“…To support the explosive growth of wireless traffic, the emerging control- and user-plane separation (CUPS) paradigm allows control base stations (CBSs) to…”
Získat plný text

Weighted Depth of Deterministic and Nondeterministic Decision Trees for Recognition Properties of Decision Rule Systems Autor Durdymyradov, Kerven, Moshkov, Mikhail

“… This paper discusses various problems related to recognizing properties of decision rule systems using deterministic and nonde-terministic decision trees as solution algorithms…”
Získat plný text

True random and adjustable memory management evaluation framework with Markov chain Autor 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…”
Získat plný text

ComVIS—Interactive simulation environment for compiler learning Autor Jovanović, Nenad, Stamenković, Srećko, Miljković, Dragiša, Chakraborty, Pinaki

“…) or nondeterministic finite automata, and simulate Thompson's construction algorithm. The process of constructing…”
Získat plný text

Editorial: P versus NP problem from Formal Languages Theory View Autor 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…”
Získat plný text