Results 1  10
of
337,169
Recursive Solutions of the Matrix Equations
"... Two classes of recursive algorithms for computing the extreme solutions of the matrix equations X+ATX−1A = Q and X−ATX−1A = Q are presented. The Per Step Algorithms are based on the fixed point iteration method and its variations; the proposed Per Step Algorithm is an inversion free variant of the ..."
Abstract
 Add to MetaCart
Two classes of recursive algorithms for computing the extreme solutions of the matrix equations X+ATX−1A = Q and X−ATX−1A = Q are presented. The Per Step Algorithms are based on the fixed point iteration method and its variations; the proposed Per Step Algorithm is an inversion free variant
Recursive Distributed Representations
 Artificial Intelligence
, 1990
"... A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract

Cited by 409 (9 self)
 Add to MetaCart
A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
FastSLAM: A Factored Solution to the Simultaneous Localization and Mapping Problem
 In Proceedings of the AAAI National Conference on Artificial Intelligence
, 2002
"... The ability to simultaneously localize a robot and accurately map its surroundings is considered by many to be a key prerequisite of truly autonomous robots. However, few approaches to this problem scale up to handle the very large number of landmarks present in real environments. Kalman filterbase ..."
Abstract

Cited by 588 (10 self)
 Add to MetaCart
based algorithms, for example, require time quadratic in the number of landmarks to incorporate each sensor observation. This paper presents FastSLAM, an algorithm that recursively estimates the full posterior distribution over robot pose and landmark locations, yet scales logarithmically with the number
An Introduction to the Kalman Filter
 UNIVERSITY OF NORTH CAROLINA AT CHAPEL HILL
, 1995
"... In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area o ..."
Abstract

Cited by 1132 (15 self)
 Add to MetaCart
In 1960, R.E. Kalman published his famous paper describing a recursive solution to the discretedata linear filtering problem. Since that time, due in large part to advances in digital computing, the Kalman filter has been the subject of extensive research and application, particularly in the area
Recursive Functions of Symbolic Expressions and Their Computation by Machine, Part I
, 1960
"... this paper in L a T E Xpartly supported by ARPA (ONR) grant N000149410775 to Stanford University where John McCarthy has been since 1962. Copied with minor notational changes from CACM, April 1960. If you want the exact typography, look there. Current address, John McCarthy, Computer Science Depa ..."
Abstract

Cited by 452 (3 self)
 Add to MetaCart
Department, Stanford, CA 94305, (email: jmc@cs.stanford.edu), (URL: http://wwwformal.stanford.edu/jmc/ ) by starting with the class of expressions called Sexpressions and the functions called Sfunctions. In this article, we first describe a formalism for defining functions recursively. We believe
TimeRecursive Solution to the Inverse Problem of Electrocardiography
"... This paper presents a new approach to the estimation of epicardial potentials from measured body surface potentials. This problem is illposed, and regularization techniques, through incorporation of a priori information on the solution, provide an efficient way of improving the quality of the estim ..."
Abstract

Cited by 3 (0 self)
 Add to MetaCart
This paper presents a new approach to the estimation of epicardial potentials from measured body surface potentials. This problem is illposed, and regularization techniques, through incorporation of a priori information on the solution, provide an efficient way of improving the quality
Recursive Solution Methods for Dynamic Linear Rational Expectations Models
 Journal of Econometrics
, 1989
"... This paper develops recursive solution methods for linear rational expectations models. The underlying structural model is transformed into a statespace representation, which can then be used to solve the model and to form the Gaussian likelihood function. The recursive solution method has several ..."
Abstract

Cited by 10 (4 self)
 Add to MetaCart
This paper develops recursive solution methods for linear rational expectations models. The underlying structural model is transformed into a statespace representation, which can then be used to solve the model and to form the Gaussian likelihood function. The recursive solution method has several
A recursive solution concept for multichoice games
, 2007
"... Abstract. We propose a new axiomatization of the Shapley value for cooperative games, where symmetry and efficiency can be discarded and replaced with new natural axioms. From any game, an excludedplayer game is built by discarding all coalitions that contain a fixed player. Then it is shown that t ..."
Abstract
 Add to MetaCart
Abstract. We propose a new axiomatization of the Shapley value for cooperative games, where symmetry and efficiency can be discarded and replaced with new natural axioms. From any game, an excludedplayer game is built by discarding all coalitions that contain a fixed player. Then it is shown that the Shapley value is the unique value satisfying the linearity axiom, the nullity axiom, the excludednullplayer axiom, and the equity axiom. In the second part, by generalizing the above material, the Shapley value for multichoice games is worked out. Key words. Shapley value, multichoice games, equity, generalized nullity axiom. 1
Recursive Solutions for Discrete Time Queues with Applications to High Speed Switching Fabrics
, 1992
"... Fast recursive solutions for the equilibrium state probabilities of discrete time queuing systems are presented. A form of boundary balancing is used to arrive at their solutions. Cases examined include the Geom/Geom/K/N queue, a queue with a varying number of servers and the Manhattan Street metro ..."
Abstract
 Add to MetaCart
Fast recursive solutions for the equilibrium state probabilities of discrete time queuing systems are presented. A form of boundary balancing is used to arrive at their solutions. Cases examined include the Geom/Geom/K/N queue, a queue with a varying number of servers and the Manhattan Street metro
Results 1  10
of
337,169