Results 11 to 20 of about 21,948 (228)
Efficient algorithms for computing bisimulations for nondeterministic fuzzy transition systems [PDF]
Fuzzy Sets and SystemsFuzzy transition systems offer a robust framework for modeling and analyzing systems with inherent uncertainties and imprecision, which are prevalent in real-world scenarios. As their extension, nondeterministic fuzzy transition systems (NFTSs) have been studied in a considerable number of works. Wu et al. (2018) provided an algorithm for computing the
Linh Anh Nguyen
openalex +3 more sources
Fast Nondeterministic Matrix Multiplication via Derandomization of Freivalds’ Algorithm [PDF]
, 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
openalex +5 more sources
Efficient Algorithms for Handling Nondeterministic Automata [PDF]
, 2011 Finite (word, tree, or omega) automata play an important role in different areas of computer science, including, for instance, formal verification. Often, deterministic automata are used for which traditional algorithms for important operations such as minimisation and inclusion checking are available. However, the use of deterministic automata implies
Tomáš Vojnar
openalex +3 more sources
Algorithmically Bypassing Censorship on Sina Weibo with Nondeterministic Homophone Substitutions
Proceedings of the International AAAI Conference on Web and Social Media, 2021 Like traditional media, social media in China is subject to censorship. However, in limited cases, activists have employed homophones of censored keywords to avoid detection by keyword matching algorithms. In this paper, we show that it is possible to scale this idea up in ways that make it difficult to defend against.
Chaya Hiruncharoenvate +2 more
openalex +3 more sources
A hybrid differential evolution algorithm for distributed assembly flexible job shop scheduling with batch delivery and inventory [PDF]
Scientific ReportsCustomer demand in the production of building material for equipment groups is often regional. Thus, this paper introduces a batch delivery strategy and considers inventory costs.
ShengWen Zhou +3 more
doaj +2 more sources
Algorithmic Analysis of Termination Problems for Nondeterministic Quantum Programs [PDF]
We consider the two categories of termination problems of quantum programs with nondeterminism: 1) Is an input of a program terminating with probability one under all schedulers? If not, how can a scheduler be synthesized to evidence the nontermination? 2) Are all inputs terminating with probability one under their respective schedulers?
Jianling Fu +4 more
openalex +3 more sources
A Nondeterministic Polynomial-Time Unification Algorithm for Bags, Sets and Trees [PDF]
, 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
openalex +4 more sources
A Nondeterministic Minimization Algorithm [PDF]
, 1990 The problem of minimizing a multivariate function is recurrent in many disciplines as Physics, Mathematics, Engeneering and, of course, Computer Science. In this paper we describe a simple nondeterministic algorithm which is based on the idea of adaptive noise, and that proved to be particularly effective in the minimization of a class of multivariate,
Bruno Caprile, Federico Girosi
openalex +2 more sources
Intelligent ComputingIn the field of path planning, the efficiency and effectiveness of deep reinforcement learning (DRL) methods are often constrained by the algorithms’ exploration capabilities, particularly in dynamic and nondeterministic environments.
Junxiao Xue, Jinpu Chen, Shiwen Zhang
doaj +2 more sources
Complete axiomatization of algorithmic properties of program schemes with bounded nondeterministic interpretations [PDF]
Proceedings of the twelfth annual ACM symposium on Theory of computing - STOC '80, 1980 Propositional algorithmic logic PAL is a propositional counterpart of algorithmic logics. It investigates properties of program connectives: begin...end, while...do, if..then..else, or .... PAL supplies tools for reasoning about programs constructed from program variables by means of program connectives and about their algorithmic properties.
Grażyna Mirkowska
openalex +2 more sources