3360 search results - page 79 / 672 » An Optimal Distributed Edge-Biconnectivity Algorithm |
166
click to vote
PPSN
2010
Springer
15 years 12 days ago
2010
Springer
The all-pairs shortest path problem is the first non-artificial problem for which it was shown that adding crossover can significantly speed up a mutation-only evolutionary algorit...
103
Voted
CP
2003
Springer
15 years 7 months ago
2003
Springer
Incomplete decision algorithms can often solve larger problem instances than complete ones. The drawback is that one does not know whether the algorithm will finish soon, later, ...
130
Voted
ATAL
2008
Springer
15 years 4 months ago
2008
Springer
This work presents a best-first anytime algorithm for computing optimal coalition structures. The approach is novel in that it generates coalition structures based on coalition va...
106
click to vote
PARELEC
2002
IEEE
15 years 7 months ago
2002
IEEE
In this paper, techniques for optimization of net algorithms describing parallel asynchronous computations and derived from cycling and branching behavioral descriptions are prese...
124
click to vote
DAGSTUHL
2007
15 years 4 months ago
2007
Stochastic optimization problems provide a means to model uncertainty in the input data where the uncertainty is modeled by a probability distribution over the possible realizatio...