Sciweavers

9284 search results - page 215 / 1857
» Knowledge State Algorithms
Sort
View
BSL
2008
98views more  BSL 2008»
15 years 6 months ago
A Natural Axiomatization of Computability and Proof of Church's Thesis
Church's Thesis asserts that the only numeric functions that can be calculated by effective means are the recursive ones, which are the same, extensionally, as the Turingle nu...
Nachum Dershowitz, Yuri Gurevich
148
Voted
AUTOMATICA
2005
83views more  AUTOMATICA 2005»
15 years 6 months ago
Linear dynamic filtering with noisy input and output
State estimation problems for linear time-invariant systems with noisy inputs and outputs are considered. An efficient recursive algorithm for the smoothing problem is presented. ...
Ivan Markovsky, Bart De Moor
AUTOMATICA
1999
44views more  AUTOMATICA 1999»
15 years 6 months ago
Square-root information filtering and fixed-interval smoothing with singularities
The square-root information filter and smoother algorithms have been generalized to handle singular state transition matrices and perfect measurements. This has been done to allow...
Mark L. Psiaki
ATAL
2008
Springer
15 years 8 months ago
Learning to interact: connecting perception with action in virtual environments
Modeling synthetic characters which interact with objects in dynamic virtual worlds is important when we want the agents to act in an autonomous and non-preplanned way. Such inter...
Pedro Sequeira, Ana Paiva
ISMIS
2009
Springer
16 years 1 months ago
A General Framework for Revising Belief Bases Using Qualitative Jeffrey's Rule
Intelligent agents require methods to revise their epistemic state as they acquire new information. Jeffrey’s rule, which extends conditioning to uncertain inputs, is used to re...
Salem Benferhat, Didier Dubois, Henri Prade, Mary-...