1604 search results - page 123 / 321 » Approximation algorithms for developable surfaces |
156
click to vote
GLOBECOM
2006
IEEE
16 years 14 days ago
2006
IEEE
In this letter we develop an expression for the approximate throughput guarantee violation probability (TGVP) for users in time-slotted networks for any scheduling algorithm with ...
193
click to vote
SPAA
1998
ACM
15 years 10 months ago
1998
ACM
In this paper we develop models for and analyze several randomized work stealing algorithms in a dynamic setting. Our models represent the limiting behavior of systems as the numb...
180
click to vote
AAAI
2006
15 years 7 months ago
2006
We discuss the problem of finding a good state representation in stochastic systems with observations. We develop a duality theory that generalizes existing work in predictive sta...
167
click to vote
SIAMJO
2008
15 years 4 months ago
2008
A class of trust-region algorithms is developed and analyzed for the solution of minimization problems with nonlinear inequality constraints. Based on composite-step trust region ...
210
click to vote
ATAL
2005
Springer
15 years 12 months ago
2005
Springer
Reinforcement learning problems are commonly tackled with temporal difference methods, which use dynamic programming and statistical sampling to estimate the long-term value of ta...