4759 search results - page 384 / 952 » Parallelizing the Phylogeny Problem |
162
Voted
SPAA
2003
ACM
16 years 1 days ago
2003
ACM
Previous implementations of out-of-core columnsort limit the problem size to N ≤ (M/P)3/2, where N is the number of records to sort, P is the number of processors, and M is the ...
183
click to vote
IPPS
2002
IEEE
15 years 11 months ago
2002
IEEE
As the E-Commerce rapidly grows up, searching data is almost necessary in every application. Approximate string matching problems play a very important role to search with errors....
191
click to vote
CONCUR
2001
Springer
15 years 11 months ago
2001
Springer
We study the maximal reachability probability problem for infinite-state systems featuring both nondeterministic and probabilistic choice. The problem involves the computation of ...
176
click to vote
HPDC
2000
IEEE
15 years 11 months ago
2000
IEEE
The first decades of the new millennium will witness an explosive growth in the number and diversity of networked devices and portals. We foresee high degrees of mobility, hetero...
152
click to vote
IPPS
2000
IEEE
15 years 11 months ago
2000
IEEE
Ever since Adleman [1] solved the Hamilton Path problem using a combinatorial molecular method, many other hard computational problems have been investigated with the proposed DNA ...