Results 41 to 50 of about 4,855,672 (239)
Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains [PDF]
International Conference on Automated Planning and Scheduling, 2019 We address two central notions of fairness in the literature of nondeterministic fully observable domains. The first, which we call stochastic fairness, is classical, and assumes an environment which operates probabilistically using possibly unknown ...
Benjamin Aminof +2 more
semanticscholar +1 more source
Syntactical characterization of nondeterministic logspace complexity class
Труды Института системного программирования РАН, 2018 NL is defined as the class of languages recognizable by logspace nondeterministic Turing machines. One of the main unsolved problems in complexity theory is that of relation between classes P and NL.
D. A. Nosov
doaj +1 more source
Известия высших учебных заведений. Поволжский регион: Физико-математические науки, 2021 Background. The study considers various aspects of constructing iterative anytime algorithms for solving the problem of state minimization of nondeterministic finite automata.
M.E. Abramyan
doaj +1 more source
Antichains for the Automata-Based Approach to Model-Checking [PDF]
Logical Methods in Computer Science, 2009 We propose and evaluate antichain algorithms to solve the universality and language inclusion problems for nondeterministic Buechi automata, and the emptiness problem for alternating Buechi automata. To obtain those algorithms, we establish the existence
Laurent Doyen, Jean-Francois Raskin
doaj +1 more source
On the complexity of solving linear congruences and computing nullspaces modulo a constant [PDF]
, 2013 We consider the problems of determining the feasibility of a linear congruence, producing a solution to a linear congruence, and finding a spanning set for the nullspace of an integer matrix, where each problem is considered modulo an arbitrary constant ...
de Beaudrap, Niel
core +1 more source
A knowledge-based system with learning for computer communication network design [PDF]
, 1990 Computer communication network design is well-known as complex and hard. For that reason, the most effective methods used to solve it are heuristic. Weaknesses of these techniques are listed and a new approach based on artificial intelligence for solving
Hoang, Hai Hoc +2 more
core +2 more sources
Using of coevolutionary algorithm on P2P networks [PDF]
Serbian Journal of Electrical Engineering, 2009 Multicast routing is the basic demand to provide QOS (Quality of service) in multimedia streaming on peer to peer networks. Making multicast trees optimizing their delay cost and considering nodal and links limited bandwidth (load balance constraints) is
Rezaee Alireza
doaj +1 more source
The parameterized space complexity of model-checking bounded variable first-order logic [PDF]
, 2019 The parameterized model-checking problem for a class of first-order sentences (queries) asks to decide whether a given sentence from the class holds true in a given relational structure (database); the parameter is the length of the sentence.
Chen, Yijia +2 more
core +3 more sources
Signal processing of heart signals for the quantification of non-deterministic events
BioMedical Engineering OnLine, 2011 Background Heart signals represent an important way to evaluate cardiovascular function and often what is desired is to quantify the level of some signal of interest against the louder backdrop of the beating of the heart itself.
Baddour Natalie, Millette Véronique
doaj +1 more source
Constant-Delay Enumeration for Nondeterministic Document Spanners
SIGMOD record, 2020 One of the classical tasks in information extraction is to extract subparts of texts through regular expressions. In the database theory literature, this approach has been generalized and formalized as document spanners.
Antoine Amarilli +3 more
semanticscholar +1 more source