1041 search results - page 81 / 209 » Randomizing Reductions of Search Problems |
AE
2007
Springer
14 years 2 months ago
2007
Springer
Abstract. How has a stack of n blocks to be arranged in order to maximize its overhang over a table edge while being stable? This question can be seen as an example application for...
CVPR
2009
IEEE
15 years 3 months ago
2009
IEEE
Scarcity and infeasibility of human supervision for large
scale multi-class classification problems necessitates active
learning. Unfortunately, existing active learning methods
...
GECCO
2008
Springer
13 years 9 months ago
2008
Springer
Deceptive problems have always been considered difficult for Genetic Algorithms. To cope with this characteristic, the literature has proposed the use of Parallel Genetic Algorith...
GECCO
2009
Springer
14 years 2 months ago
2009
Springer
In this paper, we consider multi-objective evolutionary algorithms for the Vertex Cover problem in the context of parameterized complexity. We relate the runtime of our algorithms...
WWW
2008
ACM
14 years 8 months ago
2008
ACM
We consider the budget-constrained bidding optimization problem for sponsored search auctions, and model it as an online (multiple-choice) knapsack problem. We design both determi...