نتایج جستجو برای: iteration complexity
تعداد نتایج: 356024 فیلتر نتایج به سال:
The controlled harmonic oscillator with retarded damping, is an important class of optimal control problems which has an important role in oscillating phenomena in nonlinear engineering systems. In this paper, to solve this problem, we presented an analytical method. This approach is based on the homotopy perturbation method. The solution procedure becomes easier, simpler and mor...
Two-dimensional (TD) adaptive filtering is a technique that can be applied to many image, and signal processing applications. This paper extends the one-dimensional adaptive filter algorithms to TD structures and the novel TD adaptive filters are established. Based on this extension, the TD variable step-size normalized least mean squares (TD-VSS-NLMS), the TD-VSS affine projection algorithms (...
In this paper we propose a new iteration process, called the $K^{ast }$ iteration process, for approximation of fixed points. We show that our iteration process is faster than the existing well-known iteration processes using numerical examples. Stability of the $K^{ast}$ iteration process is also discussed. Finally we prove some weak and strong convergence theorems for Suzuki ge...
This report analyzes the complexity of on-line reinforcement learning algorithms, namely asynchronous real-time versions of Q-learning and value-iteration, applied to the problems of reaching any goal state from the given start state and nding shortest paths from all states to a goal state. Previous work had concluded that, in many cases, initially uninformed (i.e. tabula rasa) reinforcement le...
Community structure is vital to discover the important structures and potential property of complex networks. In recent years, the increasing quality of local community detection approaches has become a hot spot in the study of complex network due to the advantages of linear time complexity and applicable for large-scale networks. However, there are many shortcomings in these methods such as in...
In this paper, we propose a new early termination method (ETM) for Luby transform (LT) belief propagation (BP) decoder. The proposed ETM, which we call least reliable messages (LRM), observes only sign alterations of a small cluster in log-likelihood ratio (LLR) messages passing between nodes in BP decoder. Simulation results and complexity analyzes show that LRM significantly lower computation...
The power method (or iteration) is a well-known classical technique that can be used to find the dominant eigenpair of matrix. Here, we present variational quantum circuit for iteration, which eigenpairs unitary matrices and so their associated Hamiltonians. We discuss how apply combinatorial optimization problems formulated as quadratic unconstrained binary its complexity. In addition, run num...
A Resource Model of software Complexity (RMC) based on measurement theory is introduced. It is argued that a complexity measure conforming with our empirical understanding of complexity should be independent of software length. The measure is defined by w(p) = l(p)c(p), where p is any piece of software, w(p) the resouces needed in developing it, l(p) its length, and c(p) its complexity. Rules f...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید