1534 search results - page 140 / 307 » Stochastic Bounds on Execution Times of Parallel Computation... |
172
click to vote
CONCUR
2001
Springer
15 years 10 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 ...
170
click to vote
ESCIENCE
2006
IEEE
16 years 4 days ago
2006
IEEE
In this paper, we present a checkpoint-based scheme to improve the turnaround time of bag-of-tasks applications executed on institutional desktop grids. We propose to share checkp...
176
click to vote
SEW
2006
IEEE
16 years 2 days ago
2006
IEEE
Complex software systems typically involve features like time, concurrency and probability, where probabilistic computations play an increasing role. It is challenging to formaliz...
171
Voted
ALGORITHMICA
2005
15 years 6 months ago
2005
We present a new bit-parallel technique for approximate string matching. We build on two previous techniques. The first one, BPM [Myers, J. of the ACM, 1999], searches for a patte...
187
click to vote
PLDI
2012
ACM
13 years 8 months ago
2012
ACM
Software-based thread-level parallelization has been widely studied for exploiting data parallelism in purely computational loops to improve program performance on multiprocessors...