Results 221 to 230 of about 76,024 (266)

Direct robust adaptive tracking control of electric vehicles based on radial basis function neural networks. [PDF]

PLoS One
Xiao X, Fang X.
europepmc   +1 more source

Quantum annealing for inverse kinematics in robotics. [PDF]

Sci Rep
Salloum H, Savin S, Kholodov Y, Ryzhakov G, Farina M, Oseledets I.   +5 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Approximability of Clausal Constraints

Theory of Computing Systems, 2008
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Peter Jonsson, Gustav Nordh
openaire   +1 more source

L 1 -Approximation With Constraints

Transactions of the American Mathematical Society, 1990
The authors consider problems of characterization and uniqueness for best \(L^ 1\)-approximation to continuous functions, where the approximating sets are specified convex subsets of finite-dimensional subspaces. After a very interesting introduction in this area, they consider the problem of bounded coefficient approximation and best approximation ...
Pinkus, Allan, Strauss, Hans
openaire   +1 more source

Best Approximation with Coefficient Constraints

IMA Journal of Numerical Analysis, 1988
Let B denote a compact Hausdorff space containing at least \(n+1\) points and let C(B) be the normed linear space of real-valued continuous functions on B endowed with the uniform norm \(\| f\| =\max_{x\in B}| f(x)|.\) Denote by \(U_ n\) an n-dimensional subspace of C(B).
Pinkus, A., Strauss, H.
openaire   +1 more source

Approximation with Convex Constraints

SIAM Review, 1973
Summary: This paper is a study of several problems of best approximation to a given function in a normed linear space from a convex subset of a finite-dimensional subspace. Specific problems treated are one-sided approximation and approximation with a positivity constraint, such as approximation by positive polynomials, monotonic polynomials or convex ...
openaire   +2 more sources

On Approximations for Queues, II: Shape Constraints

AT&T Bell Laboratories Technical Journal, 1984
This paper continues the investigation begun in Part I [see the preceding review] of approximations for queues that are based on a few parameters partially characterizing the arrival process and the service-time distribution. Part I provides insight into approximations for intractable systems by considering the set of all possible values of the mean ...
J. G. Kuncewicz, Ward Whitt
openaire   +2 more sources

Approximating module semantics with constraints

Proceedings of the 2004 ACM symposium on Applied computing, 2004
In this paper we present a generic constraint domain for symbolic modular analysis. The idea is that the semantics of a module can be approximated by a set of relations symbolically linking the input, output and local variables. We show how this result is correct w.r.t.
openaire   +1 more source

Tractability by Approximating Constraint Languages

2003
A constraint satisfaction problem instance consists of a collection of variables that need to have values assigned to them. The assignments are limited by constraints that force the values taken by certain collections of variables (the constraint scopes) to satisfy specified properties (the constraint relations).
Martin James Green, David A. Cohen
openaire   +1 more source

Distribution-Free Approximations for Chance Constraints

Operations Research, 1974
This paper concerns developing methods for approximating a chance-constrained set when any information concerning the random variables must be derived from actual samples. Such a situation has not been presented in the literature. When existing chance-constrained programming techniques are used, it is not possible to relate the accuracy of sample ...
F. M. Allen, R. N. Braswell, P. V. Rao
openaire   +2 more sources