3038 search results - page 215 / 608 » High-Speed Function Approximation |
168
click to vote
IJCAI
1993
15 years 7 months ago
1993
Uncertainty processing methods are analysed from the viewpoint of their sensitivity to small variations of certainty factors. The analysis makes use of the algebraic theory which ...
177
click to vote
SIGECOM
2008
ACM
15 years 6 months ago
2008
ACM
We provide tight information-theoretic lower bounds for the welfare maximization problem in combinatorial auctions. In this problem, the goal is to partition m items among k bidde...
173
click to vote
FOCS
2003
IEEE
15 years 11 months ago
2003
IEEE
The degree of a polynomial representing (or approximating) a function f is a lower bound for the quantum query complexity of f. This observation has been a source of many lower bo...
165
click to vote
NIPS
2007
15 years 8 months ago
2007
Recently, we have introduced a novel approach to dynamic programming and reinforcement learning that is based on maintaining explicit representations of stationary distributions i...
185
click to vote
ARC
2007
Springer
15 years 6 months ago
2007
Springer
General delay dynamical systems in which uncertainty is present in the form of probability measure dependent dynamics are considered. Several motivating examples arising in biolog...