2899 search results - page 368 / 580 » On the Complexity of Exclusion Algorithms for Optimization |
158
click to vote
COCO
2004
Springer
15 years 12 months ago
2004
Springer
This paper develops new relationships between resource-bounded dimension, entropy rates, and compression. New tools for calculating dimensions are given and used to improve previo...
158
click to vote
ICCV
2003
IEEE
16 years 8 months ago
2003
IEEE
Example-based methods are effective for parameter estimation problems when the underlying system is simple or the dimensionality of the input is low. For complex and high-dimensio...
191
click to vote
ICML
2007
IEEE
16 years 7 months ago
2007
IEEE
Many robot control problems of practical importance, including operational space control, can be reformulated as immediate reward reinforcement learning problems. However, few of ...
212
click to vote
STOC
2004
ACM
16 years 6 months ago
2004
ACM
Abstract. In the late nineties, Erickson proved a remarkable lower bound on the decision tree complexity of one of the central problems of computational geometry: given n numbers, ...
177
click to vote
AFRICACRYPT
2010
Springer
16 years 1 months ago
2010
Springer
Abstract. The most costly operations encountered in pairing computations are those that take place in the full extension field Fpk . At high levels of security, the complexity of ...