32 search results - page 2 / 7 » Bounded rationality via recursion |
PG
2003
IEEE
13 years 10 months ago
2003
IEEE
We present an algorithm to construct a tight bounding polyhedron for a recursive procedural model. We first use an iterated function system (IFS) to represent the extent of the p...
ISSAC
2007
Springer
13 years 11 months ago
2007
Springer
The black box algorithm for separating the numerator from the denominator of a multivariate rational function can be combined with sparse multivariate polynomial interpolation alg...
CORR
2011
Springer
13 years 12 days ago
2011
Springer
We study the complexity of rewrite systems shown terminating via the dependency pair framework using processors for reduction pairs, dependency graphs, or the subterm criterion. T...
ISCAS
1999
IEEE
13 years 9 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
POPL
2010
ACM
14 years 2 months ago
2010
ACM
This paper introduces a new recursion principle for inductive data modulo -equivalence of bound names. It makes use of Oderskystyle local names when recursing over bound names. It...