نتایج جستجو برای: bounded central approximate identity

تعداد نتایج: 714018  

2001
Klaus Wich

We prove that the class of context-free languages with polynomially bounded ambiguity (PCFL) is the closure of the class of unambiguous languages (UCFL) under projections which deletes Parikh bounded symbols only. A symbol a is Parikh bounded in a language L if there is a constant c such that no word of L contains more than c occurrences of a. Furthermore PCFL is closed under the formally stron...

2004
Victor Boyarshinov Malik Magdon-Ismail

We consider L1-isotonic regression and L∞ isotonic and unimodal regression. For L1isotonic regression, we present a linear time algorithm when the number of outputs are bounded. We extend the algorithm to construct an approximate isotonic regression in linear time when the output range is bounded. We present linear time algorithms for L∞ isotonic and unimodal regression.

Journal: :Automatica 2013
Shubhendu Bhasin R. Kamalapurkar Marcus Johnson Kyriakos G. Vamvoudakis Frank L. Lewis Warren E. Dixon

An online adaptive reinforcement learning-based solution is developed for the infinite-horizon optimal control problem for continuous-time uncertain nonlinear systems. A novel actor–critic–identifier (ACI) is proposed to approximate the Hamilton–Jacobi–Bellman equation using three neural network (NN) structures—actor and critic NNs approximate the optimal control and the optimal value function,...

2017
Siep Weiland Anton A. Stoorvogel

The behavioral theory of dynamical system is used to address a deterministic system identification problem with a newly defined measure of misfit between data and linear time-invariant systems. An approximate model identification problem is formalized using this misfit criterium. In particular, Pareto optimal models are defined as feasible trade-offs between low complexity and low misfit models...

Journal: :Central Asian Survey 2018

2009
Alessandro Farinelli Alex Rogers Nick R. Jennings

In this paper we propose a novel algorithm that provides bounded approximate solutions for decentralised coordination problems. Our approach removes cycles in any general constraint network by eliminating dependencies between functions and variables which have the least impact on the solution quality. It uses the max-sum algorithm to optimally solve the resulting tree structured constraint netw...

پایان نامه :وزارت علوم، تحقیقات و فناوری - دانشگاه هنر اصفهان - دانشکده معماری و شهرسازی 1389

reserches show that relationship between human and residential places is based upo both emotional and identity structures. in other words, habitat place is not only the creator of a part of humanistic identity but also form a kind of sentimental and emotional bond that may result in tendency to maintain closeness to a specific place. therefor, formaton of emotional and identity relationship wit...

Journal: :SIAM J. Control and Optimization 2002
Achim Ilchmann Eugene P. Ryan Christopher J. Sangwin

An adaptive servomechanism is developed in the context of the problem of approximate or practical tracking (with prescribed asymptotic accuracy), by the system output, of any admissible reference signal (absolutely continuous and bounded with essentially bounded derivative) for every member of a class of controlled dynamical systems modelled by functional differential equations.

2013
Claire Mathieu Hang Zhou

We study the problem of reconstructing a hidden graph given access to a distance oracle. We design randomized algorithms for the following problems: reconstruction of a degree bounded graph with query complexity Õ(n); reconstruction of a degree bounded outerplanar graph with query complexity Õ(n); and near-optimal approximate reconstruction of a general graph.

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید