400 search results - page 17 / 80 » Parallel Algorithms with Optimal Speedup for Bounded Treewid... |
116
click to vote
SPAA
1993
ACM
15 years 1 months ago
1993
ACM
d Abstract) Thomas H. Cormen Leonard F. Wisniewski Department of Mathematics and Computer Science Dartmouth College We give asymptotically equal lower and upper bounds for the num...
AIPS
2006
14 years 11 months ago
2006
We present a new algorithm for conformant probabilistic planning, which for a given horizon produces a plan that maximizes the probability of success under quantified uncertainty ...
GECCO
2007
Springer
15 years 3 months ago
2007
Springer
The Cross Entropy algorithm is a new search method for combinatorial problem. However, it needs considerable computational time to achieve good solution quality. To make the Cross...
HIPC
2003
Springer
15 years 2 months ago
2003
Springer
Abstract. In this paper, we propose a new approach, parallel iterative improvement (PII), to solving the stable matching problem. This approach treats the stable matching problem a...
IEEECIT
2010
IEEE
14 years 8 months ago
2010
IEEE
—Error concealment restores the visual integrity of image content that has been damaged due to a bad network transmission. Best neighborhood matching (BNM) is an effective image ...