44 search results - page 4 / 9 » Bounding Rationality by Discounting Time |
183
click to vote
WINE
2005
Springer
15 years 11 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
146
click to vote
VLSID
2008
IEEE
16 years 6 months ago
2008
IEEE
We present a discrete-time time-domain vector fitting algorithm, called TD-VFz, for rational function macromodeling of port-to-port responses with discrete time-sampled data. The ...
156
click to vote
CASC
2010
Springer
15 years 4 months ago
2010
Springer
We discuss the algorithms which, given a linear difference equation with rational function coefficients over a field k of characteristic 0, compute a polynomial U(x) ∈ k[x] (a ...
153
click to vote
DALT
2005
Springer
15 years 11 months ago
2005
Springer
Agents need to be able to change their beliefs; in particular, they should be able to contract or remove a certain belief in order to restore consistency to their set of beliefs, a...
163
click to vote
IJCAI
2001
15 years 7 months ago
2001
A general and expressive model of sequential decision making under uncertainty is provided by the Markov decision processes (MDPs) framework. Complex applications with very large ...