583 search results - page 57 / 117 » New algorithms for efficient parallel string comparison |
119
Voted
CC
2008
Springer
15 years 2 months ago
2008
Springer
There exists a positive constant < 1 such that for any function T(n) n and for any problem L BPTIME(T(n)), there exists a deterministic algorithm running in poly(T(n)) time w...
103
Voted
IJACTAICIT
2010
14 years 12 months ago
2010
In this article, a hybrid optimization method has been proposed consisting of modified ant colony systems (ACSs) and constrained nonlinear programming (NLP) to solve the problems ...
108
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
Graphic cards performance increase and fast Internet connections are popularising Networked Virtual Environments. This immature paradigm of real-time applications has still to sol...
105
click to vote
EUROPAR
2000
Springer
15 years 6 months ago
2000
Springer
With the increasing processing power, the latency of the memory hierarchy becomes the stumbling block of many modern computer architectures. In order to speed-up the calculations, ...
139
Voted
IPPS
2003
IEEE
15 years 8 months ago
2003
IEEE
The efficient solution of large systems of linear equations represented by sparse matrices appears in many tasks. LU factorization followed by backward and forward substitutions i...