4377 search results - page 26 / 876 » Mass problems and randomness |
STOC
2002
ACM
15 years 10 months ago
2002
ACM
89
Voted
SODA
2008
ACM
14 years 11 months ago
2008
ACM
We present a simple randomized algorithmic framework for connected facility location problems. The basic idea is as follows: We run a black-box approximation algorithm for the unc...
MMAS
2010
Springer
14 years 4 months ago
2010
Springer
We propose a method for efficient solution of elliptic problems with multiscale features and randomly perturbed coefficients. We use the multiscale finite element method (MsFEM) as...
AAAI
1998
14 years 11 months ago
1998
The typical difficulty of various NP-hard problems varies with simple parameters describing their structure. This behavior is largely independent of the search algorithm, but depe...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...