4759 search results - page 387 / 952 » Parallelizing the Phylogeny Problem |
181
click to vote
HIPC
2000
Springer
15 years 10 months ago
2000
Springer
Abstract. Simple and unified non-operational specifications of the three memory consistency models Total Store Ordering (TSO), Partial Store Ordering (PSO), and Relaxed Memory Orde...
183
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...
206
click to vote
DCOSS
2010
Springer
15 years 10 months ago
2010
Springer
Abstract. We consider the problem of estimating the locations of mobile agents by fusing the measurements of displacements of the agents as well as relative position measurements b...
188
click to vote
ARCS
2008
Springer
15 years 8 months ago
2008
Springer
Abstract. A major problem considering parallel computing is maintaining memory consistency and coherency, and ensuring ownership and access rights. These problems mainly arise from...
179
click to vote
EDOC
2008
IEEE
15 years 8 months ago
2008
IEEE
Although service-oriented architectures offer real benefits when pursuing application integration and business flexibility, there are still no satisfactory solutions for dealing w...