583 search results - page 43 / 117 » New algorithms for efficient parallel string comparison |
129
click to vote
IPPS
2010
IEEE
15 years 15 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...
113
Voted
CPAIOR
2006
Springer
15 years 6 months ago
2006
Springer
Temporal planning (TP) is notoriously difficult because it requires to solve a propositional STRIPS planning problem with temporal constraints. In this paper, we propose an efficie...
120
click to vote
ESA
2007
Springer
15 years 6 months ago
2007
Springer
Abstract. In the present work, we are interested in the practical behavior of a new fptas to solve the approximation version of the 0-1 multiobjective knapsack problem. Nevertheles...
181
Voted
CPM
2009
Springer
15 years 11 days ago
2009
Springer
The longest-common-prefix (LCP) array is an adjunct to the suffix array that allows many string processing problems to be solved in optimal time and space. Its construction is a bo...
108
Voted
ICDCS
1996
IEEE
15 years 6 months ago
1996
IEEE
We propose a new algorithm for recovering asynchronously from failures in a distributed computation. Our algorithm is based on two novel concepts - a fault-tolerant vector clock t...