1429 search results - page 176 / 286 » The Complexity of the Approximation of the Bandwidth Problem |
131
click to vote
ICIP
1995
IEEE
15 years 7 months ago
1995
IEEE
We consider a general weighted least squares approximation problem with a membrane spline regularization term. The key parameters in this formulation are the weighting factors whi...
124
Voted
AAAI
2007
15 years 6 months ago
2007
Developing scalable coordination algorithms for multi-agent systems is a hard computational challenge. One useful approach, demonstrated by the Coverage Set Algorithm (CSA), explo...
133
Voted
GRAPHICSINTERFACE
2008
15 years 5 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...
139
click to vote
ICMLA
2008
15 years 5 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...
134
click to vote
NIPS
2008
15 years 5 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...