5316 search results - page 109 / 1064 » Which Search Problems Are Random |
150
Voted
ICALP
2011
Springer
14 years 6 months ago
2011
Springer
Competitive analysis is the established tool for measuring the output quality of algorithms that work in an online environment. Recently, the model of advice complexity has been in...
182
Voted
CVPR
2009
IEEE
16 years 10 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
...
140
Voted
GECCO
2008
Springer
15 years 4 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...
134
click to vote
GECCO
2009
Springer
15 years 10 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...
119
Voted
WWW
2008
ACM
16 years 4 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...