Sciweavers

9888 search results - page 1726 / 1978
» compute 2009
Sort
View
PLDI
2009
ACM
16 years 1 months ago
Analyzing recursive programs using a fixed-point calculus
We show that recursive programs where variables range over finite domains can be effectively and efficiently analyzed by describing the analysis algorithm using a formula in a ...
Salvatore La Torre, Parthasarathy Madhusudan, Genn...
FM
2009
Springer
138views Formal Methods» more  FM 2009»
16 years 1 months ago
What Can Formal Methods Bring to Systems Biology?
This position paper argues that the operational modelling approaches from the formal methods community can be applied fruitfully within the systems biology domain. The results can ...
Nicola Bonzanni, K. Anton Feenstra, Wan Fokkink, E...
IWCMC
2009
ACM
16 years 1 months ago
On fault tolerant ad hoc network design
Minimal configuration and quick deployment of ad hoc networks make it suitable for numerous applications such as emergency situations, border monitoring, and military missions, e...
Wasim El-Hajj, Hazem Hajj, Zouheir Trabelsi
ICCAD
2009
IEEE
117views Hardware» more  ICCAD 2009»
15 years 4 months ago
Binning optimization based on SSTA for transparently-latched circuits
With increasing process variation, binning has become an important technique to improve the values of fabricated chips, especially in high performance microprocessors where transpa...
Min Gong, Hai Zhou, Jun Tao, Xuan Zeng
198
Voted
ICS
2009
Tsinghua U.
15 years 11 months ago
Dynamic task set partitioning based on balancing memory requirements to reduce power consumption
ABSTRACT Because of technology advances power consumption has emerged up as an important design issue in modern high-performance microprocessors. As a consequence, research on redu...
Diana Bautista, Julio Sahuquillo, Houcine Hassan, ...
« Prev « First page 1726 / 1978 Last » Next »