536 search results - page 53 / 108 » Some Lower Bounds for the Complexity of Continuation Methods |
184
click to vote
FOCS
1999
IEEE
15 years 10 months ago
1999
IEEE
Various efforts ([?, ?, ?]) have been made in recent years to derandomize probabilistic algorithms using the complexity theoretic assumption that there exists a problem in E = dti...
170
click to vote
IROS
2006
IEEE
16 years 4 days ago
2006
IEEE
— High-gain PID position control, which is widely used with robots having complex dynamics, involves some risks in cases of abnormal events, such as unexpected environment contac...
156
click to vote
NIPS
2007
15 years 7 months ago
2007
We present a general boosting method extending functional gradient boosting to optimize complex loss functions that are encountered in many machine learning problems. Our approach...
176
click to vote
SAC
2002
ACM
15 years 5 months ago
2002
ACM
Iterative solvers such as the Jacobi and Gauss-Seidel relaxation methods are important, but time-consuming building blocks of many scientific and engineering applications. The per...
163
click to vote
RTCSA
2006
IEEE
16 years 3 days ago
2006
IEEE
This article introduces the concept of monotonic transactions. A monotonic transaction is a particular case of transactions for which the load arrival pattern is (or can be by rot...