Results 181 to 190 of about 21,948 (228)

A Nondeterministic Parallel Algorithm for General Unsymmetric Sparse LU Factorization

SIAM Journal on Matrix Analysis and Applications, 1990
A parallel algorithm for the direct LU factorization of general unsymmetric sparse matrices is presented. The algorithm D2 is based on a new nondeterministic parallel pivot search that finds a compatible pivot set${\bf S}$ of size m, followed by a parallel rank-m update. These two steps alternate until switching to dense matrix code or until the matrix
Timothy A. Davis, Pen-Chung Yew
openalex   +2 more sources

An Integrated Deterministic and Nondeterministic Inference Algorithm for Sequential Labeling

, 2010
In this paper, we present a new search algorithm for sequential labeling tasks based on the conditional Markov models (CMMs) frameworks. Unlike conventional beam search, our method traverses all possible incoming arcs and also considers the “local best” so-far of each previous node.
Yu-Chieh Wu, Yue-Shi Lee, Jie-Chi Yang, Show-Jane Yen   +3 more
openalex   +2 more sources

Nondeterministic encryption with provable nonequivalence of all modifications of the cryptographic algorithm

Cybernetics and Systems Analysis, 1998
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Nikolay A. Moldovyan
openalex   +3 more sources

Some of the next articles are maybe not open access.

Related searches:

Parallel Algorithms for Minimal Nondeterministic Finite Automata Inference

Fundamenta Informaticae, 2021
The goal of this paper is to develop the parallel algorithms that, on input of a learning sample, identify a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples. Given a sample, a minimal NFA that represents the target regular language is sought.
Jastrzab, Tomasz, Czech, Zbigniew J., Wieczorek, Wojciech   +2 more
openaire   +2 more sources

Nondeterministic Moore Automata and Brzozowski’s Algorithm

2011
Moore automata represent a model that has many applications. In this paper we define a notion of coherent nondeterministic Moore automaton (NMA) and show that such a model has the same computational power of the classical deterministic Moore automaton. We consider also the problem of constructing the minimal deterministic Moore automaton equivalent to ...
CASTIGLIONE, Giuseppa, RESTIVO, Antonio, SCIORTINO, Marinella   +2 more
openaire   +2 more sources

Generating Minimal Nondeterministic Finite Automata Using a Parallel Algorithm

2020 19th International Symposium on Parallel and Distributed Computing (ISPDC), 2020
The goal of this paper is to develop a parallel algorithm that, on input of a learning sample, identifies a regular language by means of a nondeterministic finite automaton (NFA). A sample is a pair of finite sets containing positive and negative examples.
Tomasz Jastrzab, Zbigniew J. Czech, Wojciech Wieczorek   +2 more
openaire   +1 more source

A review of the nondeterministic waiting time algorithm

Natural Computing, 2010
We provide the description for the nondeterministic waiting time (NWT) algorithm, a biochemical modeling approach based on the membrane systems paradigm of computation. The technique provides a unique (different to Gillespie's algorithm or ODE modeling) perspective on the biochemical evolution of the cell.
Jack J., Paun A., Rodriguez-Paton A.
openaire   +1 more source

Algorithmic logic with nondeterministic programs1

Fundamenta Informaticae, 1980
Algorithmic properties of nondeterministic programs are studied and axiomatized completely. Nondeterministic programs require two kinds of algorithmic formulas describing their behaviour: ΔKa – all computations of the program K are finite and all results satisfy a and ∇Ka – there exists a finite computation such that its result satisfies the formula a.
openaire   +1 more source

Global Transformer Design Optimization Using Deterministic and Nondeterministic Algorithms

IEEE Transactions on Industry Applications, 2014
This paper compares the application of two deterministic and three nondeterministic optimization algorithms to global transformer design optimization (TDO). Two deterministic optimization algorithms (mixed-integer nonlinear programming and heuristic algorithm) are compared to three nondeterministic approaches (harmony search, differential evolution ...
Eleftherios I. Amoiralis, Marina A. Tsili, Dimitrios G. Paparigas, Antonios G. Kladas   +3 more
openaire   +1 more source

Nondeterministic Polynomial Time Algorithm for Estimation of Space Launch Base Launch Capacity

Acta Astronautica
Michal Kurela, Olivier Nogues, Jean-Frédéric Alasa   +2 more
openalex   +2 more sources