1603 search results - page 184 / 321 » Universal Confidence Sets for Solutions of Optimization Prob... |
160
click to vote
GECCO
2004
Springer
15 years 12 months ago
2004
Springer
Application-specific, parameterized local search algorithms (PLSAs), in which optimization accuracy can be traded off with runtime, arise naturally in many optimization contexts....
166
click to vote
GECCO
2008
Springer
15 years 7 months ago
2008
Springer
Investors vary with respect to their expected return and aversion to associated risk, and hence also vary in their performance expectations of the stock market portfolios they hol...
235
click to vote
ICASSP
2011
IEEE
14 years 10 months ago
2011
IEEE
—The low-rank matrix completion problem can be stated as follows: given a subset of the entries of a matrix, find a low-rank matrix consistent with the observations. There exist...
135
click to vote
ATAL
2009
Springer
16 years 1 months ago
2009
Springer
In context-aware route planning, a set of agents has to plan routes on a common infrastructure and each agent has to plan a conflict-free route from a source to a destination wit...
193
click to vote
FOCS
2008
IEEE
16 years 29 days ago
2008
IEEE
We present a technique for transforming classical approximation algorithms into constant-time algorithms that approximate the size of the optimal solution. Our technique is applic...