Sciweavers

1921 search results - page 165 / 385
» Making AC-3 an Optimal Algorithm
Sort
View
GECCO
2010
Springer
187views Optimization» more  GECCO 2010»
15 years 7 months ago
The maximum hypervolume set yields near-optimal approximation
In order to allow a comparison of (otherwise incomparable) sets, many evolutionary multiobjective optimizers use indicator functions to guide the search and to evaluate the perfor...
Karl Bringmann, Tobias Friedrich
ICML
2006
IEEE
16 years 3 months ago
Iterative RELIEF for feature weighting
RELIEF is considered one of the most successful algorithms for assessing the quality of features. In this paper, we propose a set of new feature weighting algorithms that perform s...
Yijun Sun, Jian Li
JACM
2006
98views more  JACM 2006»
15 years 2 months ago
Distribution sort with randomized cycling
Parallel independent disks can enhance the performance of external memory (EM) algorithms, but the programming task is often di cult. In this paper we develop randomized variants ...
Jeffrey Scott Vitter, David A. Hutchinson
SIGMETRICS
2012
ACM
248views Hardware» more  SIGMETRICS 2012»
13 years 4 months ago
Pricing cloud bandwidth reservations under demand uncertainty
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...
Di Niu, Chen Feng, Baochun Li
SIGIR
2011
ACM
14 years 5 months ago
Functional matrix factorizations for cold-start recommendation
A key challenge in recommender system research is how to effectively profile new users, a problem generally known as cold-start recommendation. Recently the idea of progressivel...
Ke Zhou, Shuang-Hong Yang, Hongyuan Zha