Results 11 to 20 of about 4,855,672 (239)
Embedded Systems and Applications, 2018 Motivated by studying the power of randomness, certifying algorithms and barriers for fine-grained reductions, we investigate the question whether the multiplication of two $n\times n$ matrices can be performed in near-optimal nondeterministic time $\tilde{O}(n^2)$.
Marvin Künnemann
semanticscholar +10 more sources
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm [PDF]
IFIP TCS, 2014 We design two nondeterministic algorithms for matrix multiplication. Both algorithms are based on derandomization of Freivalds’ algorithm for verification of matrix products. The first algorithm works with real numbers and its time complexity on Real RAMs is O(n2logn). The second one is of the same complexity, works with integer matrices on a unit cost
Jiřı́ Wiedermann
semanticscholar +7 more sources
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees [PDF]
Foundations of Software Science and Computation Structure, 1999 Unification in logic programming deals with tree-like data represented by terms. Some applications, including deductive databases, require handling more complex values, for example finite sets or bags (finite multisets). We extend unification to the combined domain of bags, sets and trees in which bags and sets are generated by constructors similar to ...
Evgeny Dantsin +1 more
semanticscholar +5 more sources
An Algorithm for Matching Nondeterministic Services with Operating Guidelines [PDF]
International Journal of Business Process Integration and Management, 2006 Interorganizational cooperation is more and more organized by the paradigm of services. Service-oriented architectures (SOA) provide a general framework for service interaction. SOA describe three roles of services, the service provider, the service requester, and the service broker, together with the three operations publish, find, and bind. We
Peter Massuthe, Karsten Wolf
semanticscholar +7 more sources
Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data
International Journal of Intelligent Systems, 2013 We have been proposing a framework rough Nondeterministic information analysis, which considers granular computing concepts in tables with incomplete and nondeterministic information, as well as rule generation.
Hiroshi Sakai, Mao Wu, Michinori Nakata
semanticscholar +4 more sources
Nondeterministic Moore automata and Brzozowski’s minimization algorithm
Theoretical Computer Science, 2012 AbstractMoore 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.
Giuseppa Castiglione +2 more
openalex +5 more sources
Electronic Proceedings in Theoretical Computer Science, 2015 Homing preset and adaptive experiments with Finite State Machines (FSMs) are widely used when a non-initialized discrete event system is given for testing and thus, has to be set to the known state at the first step.
Kushik, Natalia, Yevtushenko, Nina
core +6 more sources
Deterministic Versus Nondeterministic Optimization Algorithms for the Restricted Boltzmann Machine. [PDF]
J Comput Cogn EngA restricted Boltzmann machine is a fully connected shallow neural network. It can be used to solve many challenging optimization problems. The Boltzmann machines are usually considered probability models. Probability models normally use nondeterministic algorithms to solve their parameters.
Zeng GL.
europepmc +3 more sources
Nondeterministic functional transducer inference algorithm
, 2020 The purpose of this paper is to present an algorithm for inferring nondeterministic functional transducers. It has a lot in common with other well known algorithms such has RPNI and OSTIA. Indeed we will argue that this algorithm is a generalisation of both of them.
Aleksander Mendoza-Drosik
openalex +4 more sources
International Journal of Computational Intelligence Systems, 2021 The permutation flow shop scheduling problem (PFSSP) is a typical production scheduling problem and it has been proved to be a nondeterministic polynomial (NP-hard) problem when its scale is larger than 3.
Jiang Li +5 more
semanticscholar +3 more sources