4377 search results - page 298 / 876 » Mass problems and randomness |
180
click to vote
FSTTCS
1995
Springer
15 years 10 months ago
1995
Springer
Karp and Zhang developed a general randomized parallel algorithm for solving branch and bound problems. They showed that with high probability their algorithm attained optimal spe...
217
click to vote
ICALP
1991
Springer
15 years 10 months ago
1991
Springer
We give an on-line deterministic algorithm for the weighted bipartite matching problem that achieves a competitive ratio of (2n − 1) in any metric space (where n is the number o...
168
click to vote
AAAI
2008
15 years 9 months ago
2008
The survey propagation (SP) algorithm has been shown to work well on large instances of the random 3-SAT problem near its phase transition. It was shown that SP estimates marginal...
177
click to vote
CEC
2008
IEEE
15 years 8 months ago
2008
IEEE
In this paper, we propose a multilevel cooperative coevolution (MLCC) framework for large scale optimization problems. The motivation is to improve our previous work on grouping ba...
135
click to vote
SODA
2003
ACM
15 years 8 months ago
2003
ACM
We introduce the following consensus estimate problem. Several processors hold private and possibly different lower bounds on a value. The processors do not communicate with each ...