Sciweavers

3333 search results - page 5 / 667
» Optimal Power-Down Strategies
Sort
View
EMMCVPR
2011
Springer
12 years 7 months ago
Branch and Bound Strategies for Non-maximal Suppression in Object Detection
In this work, we are concerned with the detection of multiple objects in an image. We demonstrate that typically applied objectives have the structure of a random field model, but...
Matthew B. Blaschko
GECCO
2011
Springer
224views Optimization» more  GECCO 2011»
12 years 10 months ago
Mirrored sampling in evolution strategies with weighted recombination
This paper introduces mirrored sampling into evolution strategies (ESs) with weighted multi-recombination. Two further heuristics are introduced: pairwise selection selects at mos...
Anne Auger, Dimo Brockhoff, Nikolaus Hansen
AAAI
2011
12 years 7 months ago
Commitment to Correlated Strategies
The standard approach to computing an optimal mixed strategy to commit to is based on solving a set of linear programs, one for each of the follower’s pure strategies. We show t...
Vincent Conitzer, Dmytro Korzhyk
SIGMOD
2011
ACM
267views Database» more  SIGMOD 2011»
12 years 10 months ago
A latency and fault-tolerance optimizer for online parallel query plans
We address the problem of making online, parallel query plans fault-tolerant: i.e., provide intra-query fault-tolerance without blocking. We develop an approach that not only achi...
Prasang Upadhyaya, YongChul Kwon, Magdalena Balazi...
JMLR
2012
11 years 9 months ago
Adaptive MCMC with Bayesian Optimization
This paper proposes a new randomized strategy for adaptive MCMC using Bayesian optimization. This approach applies to nondifferentiable objective functions and trades off explor...
Nimalan Mahendran, Ziyu Wang, Firas Hamze, Nando d...