4377 search results - page 248 / 876 » Mass problems and randomness |
209
click to vote
GECCO
2005
Springer
16 years 5 days ago
2005
Springer
Investigating and enhancing the performance of genetic algorithms in dynamic environments have attracted a growing interest from the community of genetic algorithms in recent year...
182
click to vote
ESA
2008
Springer
15 years 8 months ago
2008
Springer
For several NP-hard network design problems, the best known approximation algorithms are remarkably simple randomized algorithms called Sample-Augment algorithms in [11]. The algor...
170
click to vote
ICML
2010
IEEE
15 years 7 months ago
2010
IEEE
We consider the general, widely applicable problem of selecting from n real-valued random variables a subset of size m of those with the highest means, based on as few samples as ...
167
click to vote
EOR
2010
15 years 6 months ago
2010
Continuous GRASP (C-GRASP) is a stochastic local search metaheuristic for finding cost-efficient solutions to continuous global optimization problems subject to box constraints (Hi...
171
click to vote
DMKD
2004
ACM
16 years 2 days ago
2004
ACM
Privacy concerns have become an important issue in data mining. A popular way to preserve privacy is to randomize the dataset to be mined in a systematic way and mine the randomiz...