1182 search results - page 35 / 237 » Reducing the Overhead of Dynamic Analysis |
CCGRID
2009
IEEE
13 years 10 months ago
2009
IEEE
To address coordination and complexity issues, we formulate a grid task allocation problem as a bargaining based self-adaptive auction and propose the BarSAA grid task-bundle alloc...
EUROPAR
2010
Springer
13 years 9 months ago
2010
Springer
Abstract. We study the problem of dynamic load-balancing on hierarchical platforms. In particular, we consider applications involving heavy communications on a distributed platform...
TPDS
2008
13 years 8 months ago
2008
In this paper, we address the problem of destination anonymity for applications in mobile ad hoc networks where geographic information is ready for use in both ad hoc routing and I...
INFOCOM
2012
IEEE
11 years 11 months ago
2012
IEEE
—We study error estimating codes with the goal of establishing better bounds for the theoretical and empirical overhead of such schemes. We explore the idea of using sketch data ...
IPPS
2006
IEEE
14 years 2 months ago
2006
IEEE
The saturation strategy for symbolic state-space generation is very effective for globally-asynchronous locally-synchronous discrete-state systems. Its inherently sequential natu...