Results 101 to 110 of about 21,948 (228)
We propose a novel approach for coping with alternating quantification as the main source of nonelementary complexity of deciding WS1S formulae. Our approach is applicable within the state-of-the-art automata-based WS1S decision procedure implemented, e ...
Fiedor, Tomas +3 more
core +1 more source
Automatic Probabilistic Program Verification through Random Variable Abstraction
The weakest pre-expectation calculus has been proved to be a mature theory to analyze quantitative properties of probabilistic and nondeterministic programs.
Barsotti, Damián, Wolovick, Nicolás
core +2 more sources
Low‐correlation sidelobes are critical for spectrally compatible waveforms in multiple‐input multiple‐output (MIMO) radar systems. This study presents a novel algorithm for designing spectrally compatible waveforms for MIMO radar with low auto‐ and cross‐
Zhaobo Jia, Lei Yu, Yinsheng Wei
doaj +1 more source
A Stable Marriage Requires Communication
The Gale-Shapley algorithm for the Stable Marriage Problem is known to take $\Theta(n^2)$ steps to find a stable marriage in the worst case, but only $\Theta(n \log n)$ steps in the average case (with $n$ women and $n$ men).
Gonczarowski, Yannai A. +3 more
core +1 more source
The Complexity of Computing the Size of an Interval [PDF]
Given a p-order A over a universe of strings (i.e., a transitive, reflexive, antisymmetric relation such that if (x, y) is an element of A then |x| is polynomially bounded by |y|), an interval size function of A returns, for each string x in the universe,
Christopher M. Homan +4 more
core +5 more sources
Constraint analysis for extended dynamic fault tree
As a new extension of dynamic fault trees,time delay gate was proposed.This new mechanism can be used to model the time delay on the fault propagation from the lower level subsystems to the higher level system.The dynamic Bayesian networks was extend to ...
Qi-xuan WU +5 more
doaj +2 more sources
In this paper, an efficient algorithm for modeling the operation of a DDT (Deterministic Decision Tree) solving the problem of realizability of DRs (Decision Rules) is proposed and analyzed.
Kerven Durdymyradov, Mikhail Moshkov
doaj +1 more source
Designing of Reversible Functions in Classical and Quantum Domains [PDF]
First sections of the paper contain some considerations relevant to the reversibility of quantum gates. The Solovay-Kitayev theorem shows that using proper set of quantum gates one can build a quantum version of the nondeterministic Turing machine.
Andrzej Skorupski, Ryszard Romaniuk
doaj +1 more source
This paper considers the problem of having a team of mobile robots to visit a set of target locations. This problem is known as multi-robot patrolling problems. In this paper, the problem is formulated as a multiple traveling salesman problem (MTSP) with
Xinye Chen +3 more
doaj +1 more source
Intelligent Layout Method of Ship Pipelines Based on an Improved Grey Wolf Optimization Algorithm
Ship piping arrangement is a nondeterministic polynomial problem. Based on the advantages of the grey wolf optimization (GWO) algorithm, which is simple, easy to implement, and has few adjustment parameters and fast convergence speed, the study adopts ...
Yongjin Lu +4 more
doaj +1 more source

