Results 261 to 270 of about 73,753 (309)

Pooling Problems with Polynomial-Time Algorithms

Journal of Optimization Theory and Applications, 2016
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Haugland, Dag, Hendrix, Eligius M.T.
openaire   +3 more sources

Polynomial-Time Algorithms for Minimum-Time Broadcast in Trees

Theory of Computing Systems, 2002
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Cohen, Johanne   +2 more
openaire   +1 more source

Polynomial-time algorithm for the orbit problem

Journal of the ACM, 1986
The accessibility problem for linear sequential machines [12] is the problem of deciding whether there is an input x such that on x the machine starting in a given state q 1 goes to a given state q 2 . Harrison shows that
Ravindran Kannan, Richard J. Lipton
openaire   +1 more source

A polynomial time algorithm for subpattern matching

Proceedings of the IEEE, 1986
An O(N3K) time algorithm for searching matches of a template of size K in an image of size N is given. It uses bounding regions and the Soviet Ellipsoid Algorithm [1]. It will work under moderately heavy shift noise.
H. L. Nyo, Minsoo Suk
openaire   +1 more source

Home - About - Disclaimer - Privacy