نتایج جستجو برای: recursive formulation
تعداد نتایج: 138538 فیلتر نتایج به سال:
The problem of the recursive formulation of the MOESP class of subspace identification algorithms is considered and two novel instrumental variable approaches are introduced. The first one leads to an RLS-like implementation, the second to a gradient type iteration. The relative merits of both approaches are analysed and discussed, while simulation results are used to compare their performance ...
The Kalman filter is the celebrated algorithm giving a recursive solution of the prediction problem for time series. After a quite general formulation of the prediction problem, the contributions of its solution by the great mathematicians Kolmogorov and Wiener are shorthly recalled and it is showed as Kalman filter furnishes the optimal predictor, in the sense of least squares, for processes w...
This paper proposes the use of constraint logic programming (CLP) to perform model checking of traditional, imperative programs. We present a semantics-preserving translation from an imperative language with heap-allocated mutable data structures and recursive procedures into CLP. The CLP formulation (1) provides a clean way to reason about the behavior and correctness of the original program, ...
D We investigate the notion of “semicomputability,” intended to generalize the notion of recursive enumerability of relations to abstract structures. Two characterizations are considered and shown to be equivalent: one in terms of “ partial computable functions’ ’ (for a suitable notion of computability over abstract structures) and one in terms of definability by means of Horn programs over su...
A multi-channel scattering problem is studied from a point of view of integral equations system. The system appears while natural one-particle wave function equation of the electron under action of a potential with non-intersecting ranges is considered. Spherical functions basis expansion of the potentials introduces partial amplitudes and corresponding radial functions. The approach is general...
We extend a previous mathematical formulation of hyperheuristics to reflect the emerging generalization of the concept. We show that this leads naturally to a recursive definition of hyper-heuristic and to a division of responsibility that is suggestive of a blackboard architecture, in which individual heuristics annotate a workspace with information that may also be of interest to other heuris...
The processing power and flexibility of recent rasterization hardware permits to speed up image generation through raytracing. This paper introduces a method that performs ray processing on the GPU in parallel to shading operations on the CPU. It effectively exploits CPU-GPU parallelism in a way that can be integrated into existing implementations utilizing the standard recursive formulation of...
We extend the recursive formulation of risk-sensitivity with discounting advocated by Hansen and Sargent (1995) to situations with a hidden state. We accomplish this by introducing two risk-sensitivity operators, each of which also expresses a concern about model misspecification. One captures a decision maker’s uncertainty about the state dynamics and the other his uncertainty about the probab...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید