1769 search results - page 156 / 354 » Choice in Dynamic Linking |
125
Voted
ASPDAC
2006
ACM
15 years 11 months ago
2006
ACM
— An effectively designed and efficiently used memory hierarchy, composed of scratch-pads or cache, is seen today as the key to obtaining energy and performance gains in data-do...
150
click to vote
SOCO
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. In addition to publishing composite services as reusable services, compositions can also be reused by applying them to orchestrate different component services. To do so...
158
click to vote
ICTAI
1997
IEEE
15 years 9 months ago
1997
IEEE
Many black box optimization algorithms have sufcient exibility to allow them to adapt to the varying circumstances they encounter. These capabilities are of two primary sorts: 1) ...
161
click to vote
INFOCOM
2006
IEEE
15 years 11 months ago
2006
IEEE
— In this paper, we propose a simulation framework, TranSim, that reduces the rate at which packet-events are generated, in order to accelerate large-scale simulation of IP netwo...
145
Voted
CP
2008
Springer
15 years 6 months ago
2008
Springer
ctural abstractions that were introduced in [17]. Compared with other symmetry-breaking techniques, the big advantage of dynamic symmetry breaking is that it can accommodate dynami...