1074 search results - page 57 / 215 » An ASM-Characterization of a Class of Distributed Algorithms |
DC
2010
14 years 9 months ago
2010
It is considered good distributed computing practice to devise object implementations that tolerate contention, periods of asynchrony and a large number of failures, but perform f...
IPPS
2006
IEEE
15 years 3 months ago
2006
IEEE
Approximate string matching problem is a common and often repeated task in information retrieval and bioinformatics. This paper proposes a generic design of a programmable array p...
COLT
2003
Springer
15 years 3 months ago
2003
Springer
Recent work has introduced Boolean kernels with which one can learn linear threshold functions over a feature space containing all conjunctions of length up to k (for any 1 ≤ k ...
LCPC
2004
Springer
15 years 3 months ago
2004
Springer
In this paper, we describe our experience in writing parallel numerical algorithms using Hierarchically Tiled Arrays (HTAs). HTAs are classes of objects that encapsulate parallelis...
IPPS
2002
IEEE
15 years 2 months ago
2002
IEEE
The convergence of iterative methods used to solve the linear systems arising in incompressible flow problems is sensitive to flow parameters such as the Reynolds number, time s...