2957 search results - page 412 / 592 » The Complexity of Polynomial-Time Approximation |
164
click to vote
GRAPHICSINTERFACE
2008
15 years 7 months ago
2008
Rendering high-quality shadows in real-time is a challenging problem. Shadow mapping has proved to be an efficient solution, as it scales well for complex scenes. However, it suff...
176
click to vote
ICMLA
2008
15 years 7 months ago
2008
In reinforcement learning, it is a common practice to map the state(-action) space to a different one using basis functions. This transformation aims to represent the input data i...
157
click to vote
IPCO
2008
15 years 7 months ago
2008
We study the stochastic machine replenishment problem, which is a canonical special case of closed multiclass queuing systems in Markov decision theory. The problem models the sche...
172
Voted
ICONIP
2007
15 years 7 months ago
2007
Abstract. Principal component analysis (PCA) is a widely used technique for data analysis and dimensionality reduction. Eigenvalue decomposition is the standard algorithm for solvi...
164
Voted
NIPS
2008
15 years 7 months ago
2008
In partially observable worlds with many agents, nested beliefs are formed when agents simultaneously reason about the unknown state of the world and the beliefs of the other agen...