Results 221 to 230 of about 138,670 (265)

Fixed-time adaptive fuzzy command filtering control for a two-joint robotic manipulator with input dead zone saturation and time-varying delay. [PDF]

PLoS One
Cao X, Zhang H, Zhang P.
europepmc   +1 more source

An Inverse Generalized Conversion Filter for State Estimation in Nonlinear Adversarial Sensing Systems. [PDF]

Sensors (Basel)
Xi YA, Dong XH, Wu SY.
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

An approximation algorithm for the TSP

Information Processing Letters, 1989
For a given complete weighted graph with n nodes, the authors present a heuristic algorithm with running time \(O(n^ 4)\) for the travelling salesman problem. Experimental studies show that the method gives better results in most cases than the well-known Quick method.
Josep M. Basart, Llorenç Huguet i Rotger   +1 more
openaire   +2 more sources

On Approximation Algorithms for # P

SIAM Journal on Computing, 1985
It is shown that any function in Valiant's class {\#}P can be approximated to within any constant factor by a function in the class \(\Delta^ P_ 3\) of the polynomial-time hierarchy. A model of random sampling is introduced and discussed in detail. The paper is of interest to specialists in the theory of algorithmic complexity.
openaire   +2 more sources

Approximation Algorithms for Treewidth

Algorithmica, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
openaire   +2 more sources

The Design of Approximation Algorithms

2011
Discrete optimization problems are everywhere, from traditional operations research planning (scheduling, facility location and network design); to computer science databases; to advertising issues in viral marketing. Yet most such problems are NP-hard; unless P = NP, there are no efficient algorithms to find optimal solutions.
David P. Williamson, David B. Shmoys
openaire   +2 more sources

Approximate decision algorithms for approximate congruence

Information Processing Letters, 1992
We derive a \(({1\over 2} \varepsilon_{opt}(A,B), \varepsilon_{opt}(A,B))\)-approximate algorithm for approximate congruence by translations with running time \(O(n^{2.5})\) and a \(({1\over 2},\varepsilon_{opt}(A,B) \varepsilon_{opt}(A,B))\)- approximate algorithm with running time \(O(n^ 4)\) for the general case.
openaire   +2 more sources