Sciweavers

620 search results - page 121 / 124
» Decidability Problems for Actor Systems
Sort
View
SPRINGSIM
2007
14 years 10 months ago
Modeling and analysis of worm defense using stochastic activity networks
— Stochastic activity networks (SANs) are a widely used formalism for describing complex systems that have random behavior. Sophisticated software tools exist for the modeling an...
David M. Nicol, Steve Hanna, Frank Stratton, Willi...
MOBISYS
2010
ACM
14 years 12 months ago
MAUI: making smartphones last longer with code offload
This paper presents MAUI, a system that enables fine-grained energy-aware offload of mobile code to the infrastructure. Previous approaches to these problems either relied heavily...
Eduardo Cuervo, Aruna Balasubramanian, Dae-ki Cho,...
CC
2007
Springer
121views System Software» more  CC 2007»
14 years 9 months ago
If NP Languages are Hard on the Worst-Case, Then it is Easy to Find Their Hard Instances
We prove that if NP ⊆ BPP, i.e., if SAT is worst-case hard, then for every probabilistic polynomial-time algorithm trying to decide SAT, there exists some polynomially samplable ...
Dan Gutfreund, Ronen Shaltiel, Amnon Ta-Shma
CC
2007
Springer
108views System Software» more  CC 2007»
14 years 9 months ago
Communication vs. Computation
We initiate a study of tradeoffs between communication and computation in well-known communication models and in other related models. The fundamental question we investigate is t...
Prahladh Harsha, Yuval Ishai, Joe Kilian, Kobbi Ni...
SAC
2008
ACM
14 years 9 months ago
Removing useless variables in cost analysis of Java bytecode
Automatic cost analysis has interesting applications in the context of verification and certification of mobile code. For instance, the code receiver can use cost information in o...
Elvira Albert, Puri Arenas, Samir Genaim, Germ&aac...