Sciweavers

1534 search results - page 30 / 307
» Stochastic Bounds on Execution Times of Parallel Computation...
Sort
View
IPPS
1995
IEEE
13 years 11 months ago
Data parallel programming in an adaptive environment
For better utilization of computing resources, it is important to consider parallel programming environments in which the number of available processors varies at runtime. In this...
Guy Edjlali, Gagan Agrawal, Alan Sussman, Joel H. ...
HYBRID
2009
Springer
13 years 11 months ago
Trajectory Based Verification Using Local Finite-Time Invariance
Abstract. In this paper we propose a trajectory based reachability analysis by using local finite-time invariance property. Trajectory based analysis are based on the execution tra...
A. Agung Julius, George J. Pappas
WEA
2004
Springer
150views Algorithms» more  WEA 2004»
14 years 1 months ago
Increased Bit-Parallelism for Approximate String Matching
Abstract. Bit-parallelism permits executing several operations simultaneously over a set of bits or numbers stored in a single computer word. This technique permits searching for t...
Heikki Hyyrö, Kimmo Fredriksson, Gonzalo Nava...
CIAC
2010
Springer
259views Algorithms» more  CIAC 2010»
13 years 11 months ago
On Strategy Improvement Algorithms for Simple Stochastic Games
The study of simple stochastic games (SSGs) was initiated by Condon for analyzing the computational power of randomized space-bounded alternating Turing machines. The game is play...
Rahul Tripathi, Elena Valkanova, V. S. Anil Kumar
CF
2010
ACM
14 years 23 days ago
Variant-based competitive parallel execution of sequential programs
Competitive parallel execution (CPE) is a simple yet attractive technique to improve the performance of sequential programs on multi-core and multi-processor systems. A sequential...
Oliver Trachsel, Thomas R. Gross