Results 1 to 10 of about 48,989 (115)
Polynomial-Time Algorithm for Learning Optimal BFS-Consistent Dynamic Bayesian Networks [PDF]
Entropy, 2018 Dynamic Bayesian networks (DBN) are powerful probabilistic representations that model stochastic processes. They consist of a prior network, representing the distribution over the initial variables, and a set of transition networks, representing the ...
Margarida Sousa, Alexandra M. Carvalho
doaj +2 more sources
Propose a Polynomial Time Algorithm for Total Completion Time Objective [PDF]
International Journal of Mathematical, Engineering and Management Sciences, 2021 In this study, we integrate deteriorate jobs with repair&maintenance activity on a single machine scheduling subject to total completion time. This work has more than one motivation.
Yucel Ozturkoglu, Omer Ozturkoglu
doaj +1 more source
An expected polynomial time algorithm for coloring 2-colorable 3-graphs [PDF]
Discrete Mathematics & Theoretical Computer Science, 2011 Graphs and ...
Yury Person, Mathias Schacht
doaj +1 more source
Query learning of derived $\omega$-tree languages in polynomial time [PDF]
Logical Methods in Computer Science, 2019 We present the first polynomial time algorithm to learn nontrivial classes of languages of infinite trees. Specifically, our algorithm uses membership and equivalence queries to learn classes of $\omega$-tree languages derived from weak regular $\omega ...
Dana Angluin +2 more
doaj +1 more source
An Improved Multi-Objective Trajectory Planning Algorithm for Kiwifruit Harvesting Manipulator
IEEE Access, 2023 Trajectory planning is always a hot issue for harvesting manipulators, considering the limitations of the manipulator mechanical structure and other nonlinear factors that result in long time, big jerk and high energy consumption of the manipulator in ...
Xiao Li +3 more
doaj +1 more source
On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry [PDF]
Logical Methods in Computer Science, 2015 An algorithm for unification modulo one-sided distributivity is an early result by Tid\'en and Arnborg. More recently this theory has been of interest in cryptographic protocol analysis due to the fact that many cryptographic operators satisfy this ...
Andrew M Marshall +2 more
doaj +1 more source
IET Control Theory & Applications, 2021 A polynomial filtering algorithm is designed for estimating a Markov sequence based on linear measurements. The feature of the estimation problem is that the Markov sequence is described by a nonlinear shaping filter, which is a second‐order polynomial ...
O. A. Stepanov +4 more
doaj +1 more source
Approximate cycles count in undirected graphs [PDF]
International Journal of Computational Intelligence Systems, 2014 In social networks, counting the number of different cycle sizes can be used to measure the entropy of the network that represents its robustness. The exact algorithms to compute cycles in a graph can generate exact results but they are not guaranteed to
Maytham Safar +5 more
doaj +1 more source
Efficient CSL Model Checking Using Stratification [PDF]
Logical Methods in Computer Science, 2012 For continuous-time Markov chains, the model-checking problem with respect to continuous-time stochastic logic (CSL) has been introduced and shown to be decidable by Aziz, Sanwal, Singhal and Brayton in 1996.
Lijun Zhang +3 more
doaj +1 more source
Polynomial time constructive decision algorithm for multivariable quantum signal processing [PDF]
QuantumQuantum signal processing (QSP) and quantum singular value transformation (QSVT) have provided a unified framework for understanding many quantum algorithms, including factorization, matrix inversion, and Hamiltonian simulation.
Yuki Ito +3 more
doaj +1 more source