Sciweavers

606 search results - page 33 / 122
» Complexity Results for Checking Distributed Implementability
Sort
View
SODA
2008
ACM
126views Algorithms» more  SODA 2008»
15 years 1 months ago
On distributing symmetric streaming computations
A common approach for dealing with large data sets is to stream over the input in one pass, and perform computations using sublinear resources. For truly massive data sets, howeve...
Jon Feldman, S. Muthukrishnan, Anastasios Sidiropo...
ISSTA
2006
ACM
15 years 5 months ago
The case for analysis preserving language transformation
Static analysis has gained much attention over the past few years in applications such as bug finding and program verification. As software becomes more complex and componentize...
Xiaolan Zhang, Larry Koved, Marco Pistoia, Sam Web...
ICC
2007
IEEE
192views Communications» more  ICC 2007»
15 years 6 months ago
Informed Dynamic Scheduling for Belief-Propagation Decoding of LDPC Codes
— Low-Density Parity-Check (LDPC) codes are usually decoded by running an iterative belief-propagation, or message-passing, algorithm over the factor graph of the code. The tradi...
Andres I. Vila Casado, Miguel Griot, Richard D. We...
JAIR
2008
123views more  JAIR 2008»
14 years 11 months ago
CTL Model Update for System Modifications
Model checking is a promising technology, which has been applied for verification of many hardware and software systems. In this paper, we introduce the concept of model update to...
Yan Zhang, Yulin Ding
JPDC
2006
106views more  JPDC 2006»
14 years 11 months ago
Adaptive algorithms for the dynamic distribution and parallel execution of agent-based models
We propose a framework for defining agent-based models (ABMs) and two algorithms for the automatic parallelization of agent-based models, a general version P-ABMG for all ABMs def...
Matthias Scheutz, Paul W. Schermerhorn