Sciweavers

3007 search results - page 8 / 602
» Linear Functional Fixed-points
Sort
View
84
Voted
CORR
2010
Springer
173views Education» more  CORR 2010»
14 years 9 months ago
Automatic Modular Abstractions for Template Numerical Constraints
c Modular Abstractions for Template Numerical Constraints David Monniaux May 26, 2010 We propose a method for automatically generating abstract transformstatic analysis by abstrac...
David Monniaux
COMBINATORICS
2002
92views more  COMBINATORICS 2002»
14 years 9 months ago
Pattern Avoidance in Permutations: Linear and Cyclic Orders
: We generalize the notion of pattern avoidance to arbitrary functions on ordered sets, and consider specifically three scenarios for permutations: linear, cyclic and hybrid, the f...
Antoine Vella
MOC
2010
14 years 4 months ago
Portrait of the four regular super-exponentials to base sqrt(2)
We introduce the concept of regular super-functions at a fixed point. It is derived from the concept of regular iteration. A super-function F of h is a solution of F(z+1)=h(F(z)). ...
Dmitrii Kouznetsov, Henryk Trappmann
ATAL
2010
Springer
14 years 10 months ago
Linear options
Learning, planning, and representing knowledge in large state t multiple levels of temporal abstraction are key, long-standing challenges for building flexible autonomous agents. ...
Jonathan Sorg, Satinder P. Singh
EWRL
2008
14 years 11 months ago
New Error Bounds for Approximations from Projected Linear Equations
We consider linear fixed point equations and their approximations by projection on a low dimensional subspace. We derive new bounds on the approximation error of the solution, whi...
Huizhen Yu, Dimitri P. Bertsekas