Results 11 to 20 of about 1,746,055 (248)
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
O(log2 k / log log k)-approximation algorithm for directed Steiner tree: a tight quasi-polynomial-time algorithm [PDF]
Symposium on the Theory of Computing, 2018 In the Directed Steiner Tree (DST) problem we are given an n-vertex directed edge-weighted graph, a root r , and a collection of k terminal nodes. Our goal is to find a minimum-cost subgraph that contains a directed path from r to every terminal.
F. Grandoni, Bundit Laekhanukit, Shi Li
semanticscholar +1 more source
Polynomial-time Algorithm for Maximum Weight Independent Set on P6-free Graphs [PDF]
ACM Trans. Algorithms, 2017 In the classic Maximum Weight Independent Set problem, we are given a graph G with a nonnegative weight function on its vertices, and the goal is to find an independent set in G of maximum possible weight. While the problem is NP-hard in general, we give
Andrzej Grzesik +3 more
semanticscholar +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
A combinatorial, strongly polynomial-time algorithm for minimizing submodular functions [PDF]
Symposium on the Theory of Computing, 2000 This paper presents a combinatorial polynomial-time algorithm for minimizing submodular functions, answering an open question posed in 1981 by Grotschel, Lov asz, and Schrijver.
S. Iwata, L. Fleischer, S. Fujishige
semanticscholar +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
A stable, polynomial-time algorithm for the eigenpair problem [PDF]
, 2014 We describe algorithms for computing eigenpairs (eigenvalue--eigenvector) of a complex $n\times n$ matrix $A$. These algorithms are numerically stable, strongly accurate, and theoretically efficient (i.e., polynomial-time).
Diego Armentano +4 more
semanticscholar +1 more source