Sciweavers

1205 search results - page 74 / 241
» On P Systems with Bounded Parallelism
Sort
View
FAST
2007
13 years 9 months ago
//TRACE: Parallel Trace Replay with Approximate Causal Events
//TRACE1 is a new approach for extracting and replaying traces of parallel applications to recreate their I/O behavior. Its tracing engine automatically discovers inter-node data ...
Michael P. Mesnier, Matthew Wachs, Raja R. Sambasi...
IJPP
2010
137views more  IJPP 2010»
13 years 6 months ago
Parallel Option Price Valuations with the Explicit Finite Difference Method
Abstract. We show how computations such as those involved in American or European-style option price valuations with the explicit finite difference method can be performed in par...
Alexandros V. Gerbessiotis
LICS
1994
IEEE
13 years 11 months ago
On the Parallel Complexity of Model Checking in the Modal Mu-Calculus
The modal mu-calculus is an expressive logic that can be used to specify safety and liveness properties of concurrent systems represented as labeled transition systems (LTSs). We ...
Shipei Zhang, Oleg Sokolsky, Scott A. Smolka
ICPP
1999
IEEE
14 years 56 min ago
An Offline Algorithm for Dimension-Bound Analysis
The vector-clock size necessary to characterize causality in a distributed computation is bounded by the dimension of the partial order induced by that computation. In an arbitrar...
Paul A. S. Ward
MDM
2007
Springer
209views Communications» more  MDM 2007»
14 years 1 months ago
Parallelized Simulated Annealing for Model Updating in Ad-Hoc Wireless Sensing Networks
The engineering community has recently begun to adopt wireless sensing technologies for use in many sensing applications. These low-cost sensors provide an optimal setting for den...
Andrew T. Zimmerman, Jerome P. Lynch