Sciweavers

466 search results - page 73 / 94
» A Worst Case Timing Analysis Technique for Optimized Program...
Sort
View
CC
2006
Springer
182views System Software» more  CC 2006»
14 years 7 days ago
Selective Runtime Memory Disambiguation in a Dynamic Binary Translator
Abstract. Alias analysis, traditionally performed statically, is unsuited for a dynamic binary translator (DBT) due to incomplete control-flow information and the high complexity o...
Bolei Guo, Youfeng Wu, Cheng Wang, Matthew J. Brid...
EMSOFT
2007
Springer
14 years 2 months ago
Methods for multi-dimensional robustness optimization in complex embedded systems
Design space exploration of embedded systems typically focuses on classical design goals such as cost, timing, buffer sizes, and power consumption. Robustness criteria, i.e. sensi...
Arne Hamann, Razvan Racu, Rolf Ernst
WWW
2008
ACM
14 years 9 months ago
Optimal marketing strategies over social networks
We discuss the use of social networks in implementing viral marketing strategies. While influence maximization has been studied in this context (see Chapter 24 of [10]), we study ...
Jason D. Hartline, Vahab S. Mirrokni, Mukund Sunda...
BMCBI
2010
116views more  BMCBI 2010»
13 years 8 months ago
Optimization algorithms for functional deimmunization of therapeutic proteins
Background: To develop protein therapeutics from exogenous sources, it is necessary to mitigate the risks of eliciting an anti-biotherapeutic immune response. A key aspect of the ...
Andrew S. Parker, Wei Zheng, Karl E. Griswold, Chr...
APL
1998
ACM
14 years 22 days ago
Reducing computational complexity with array predicates
This article describes how array predicates were used to reduce the computational complexity of four APL primitive functions when one of their arguments is a permutation vector. T...
Robert Bernecky