386 search results - page 31 / 78 » Efficient Parallel Algorithm for Optimal Three-Sequences Ali... |
127
Voted
IPPS
2010
IEEE
15 years 2 days ago
2010
IEEE
Sorting is a commonly used process with a wide breadth of applications in the high performance computing field. Early research in parallel processing has provided us with comprehen...
203
Voted
CP
2009
Springer
16 years 2 months ago
2009
Springer
The most popular architecture for parallel search is work stealing: threads that have run out of work (nodes to be searched) steal from threads that still have work. Work stealing ...
208
Voted
ICDE
2006
IEEE
16 years 3 months ago
2006
IEEE
We introduce a new domain-independent framework for formulating and efficiently evaluating similarity queries over historical data, where given a history as a sequence of timestam...
121
Voted
ICMCS
2009
IEEE
14 years 12 months ago
2009
IEEE
Parallel scalability allows an application to efficiently utilize an increasing number of processing elements. In this paper we explore a design space for parallel scalability for...
131
Voted
IPPS
2010
IEEE
15 years 2 days ago
2010
IEEE
Local search (LS) algorithms are among the most powerful techniques for solving computationally hard problems in combinatorial optimization. These algorithms could be viewed as &q...