2280 search results - page 215 / 456 » Global Optimization for Optimal Generalized Procrustes Analy... |
176
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
The No-Free-Lunch theorems (NFLTs) are criticized for being too general to be of any relevance to the real world scenario. This paper investigates, both formally and empirically, ...
163
click to vote
GECCO
2006
Springer
15 years 10 months ago
2006
Springer
We present two novel perturbation-based linkage learning algorithms that extend LINC [5]; a version of LINC optimised for decomposition tasks (oLINC) and a hierarchical version of...
245
click to vote
JMLR
2012
13 years 9 months ago
2012
We prove logarithmic regret bounds that depend on the loss L∗ T of the competitor rather than on the number T of time steps. In the general online convex optimization setting, o...
234
click to vote
SIGMETRICS
2012
ACM
13 years 9 months ago
2012
ACM
In a public cloud, bandwidth is traditionally priced in a pay-asyou-go model. Reflecting the recent trend of augmenting cloud computing with bandwidth guarantees, we consider a n...
214
click to vote
ACMMSP
2004
ACM
16 years 2 days ago
2004
ACM
Feedback-directed optimization has become an increasingly important tool in designing and building optimizing compilers. Recently, reuse-distance analysis has shown much promise i...