1554 search results - page 75 / 311 » Parameterized Complexity and Approximation Algorithms |
125
click to vote
ICML
2009
IEEE
16 years 3 months ago
2009
IEEE
The general stochastic optimal control (SOC) problem in robotics scenarios is often too complex to be solved exactly and in near real time. A classical approximate solution is to ...
136
Voted
NIPS
1998
15 years 4 months ago
1998
A simple learning rule is derived, the VAPS algorithm, which can be instantiated to generate a wide range of new reinforcementlearning algorithms. These algorithms solve a number ...
115
click to vote
SIGECOM
2010
ACM
15 years 7 months ago
2010
ACM
We analyze the complexity of computing pure strategy Nash equilibria (PSNE) in symmetric games with a fixed number of actions. We restrict ourselves to “compact” representati...
108
click to vote
GRAPHICSINTERFACE
2007
15 years 4 months ago
2007
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
120
click to vote
SIGGRAPH
2000
ACM
15 years 7 months ago
2000
ACM
This research further develops the light field and lumigraph imagebased rendering methods and extends their utility. We present alternate parameterizations that permit 1) interac...