Results 1 to 10 of about 2,188,345 (345)

Propose a Polynomial Time Algorithm for Total Completion Time Objective [PDF]

open access: yesInternational 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]

open access: yesDiscrete Mathematics & Theoretical Computer Science, 2011
Graphs and ...
Yury Person, Mathias Schacht
doaj   +1 more source

Polynomial-time algorithms for submodular Laplacian systems [PDF]

open access: yesTheoretical Computer Science, 2021
Let $G=(V,E)$ be an undirected graph, $L_G\in \mathbb{R}^{V \times V}$ be the associated Laplacian matrix, and $b \in \mathbb{R}^V$ be a vector. Solving the Laplacian system $L_G x = b$ has numerous applications in theoretical computer science, machine learning, and network analysis.
Kaito Fujii, Tasuku Soma, Yuichi Yoshida
openaire   +2 more sources

Query learning of derived $\omega$-tree languages in polynomial time [PDF]

open access: yesLogical 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

open access: yesIEEE 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

A Polynomial-Time Algorithm for Outerplanar Diameter Improvement [PDF]

open access: yesJournal of Computer and System Sciences, 2015
The Outerplanar Diameter Improvement problem asks, given a graph $G$ and an integer $D$, whether it is possible to add edges to $G$ in a way that the resulting graph is outerplanar and has diameter at most $D$. We provide a dynamic programming algorithm that solves this problem in polynomial time.
Nathann Cohen   +6 more
openaire   +4 more sources

Polynomial-time algorithms for permutation groups [PDF]

open access: yes21st Annual Symposium on Foundations of Computer Science (sfcs 1980), 1980
A permutation group on n letters may always be represented by a small set of generators, even though its size may be exponential in n. We show that it is practical to use such a representation since many problems such as membership testing, equality testing, and inclusion testing are decidable in polynomial time.
Furst, Merrick   +2 more
openaire   +1 more source

On Unification Modulo One-Sided Distributivity: Algorithms, Variants and Asymmetry [PDF]

open access: yesLogical 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

Efficiency analysis of polynomial filtering algorithms in navigation data processing for a class of nonlinear discrete dynamical systems

open access: yesIET 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

Polynomial Time Algorithms for Bichromatic Problems [PDF]

open access: yes, 2017
In this article, we consider a collection of geometric problems involving points colored by two colors (red and blue), referred to as bichromatic problems. The motivation behind studying these problems is two fold; (i) these problems appear naturally and frequently in the fields like Machine learning, Data mining, and so on, and (ii) we are interested ...
Sayan Bandyapadhyay, Aritra Banik
openaire   +2 more sources

Home - About - Disclaimer - Privacy