Sciweavers

1686 search results - page 97 / 338
» Programs as polygraphs: computability and complexity
Sort
View
MICRO
2003
IEEE
152views Hardware» more  MICRO 2003»
15 years 3 months ago
A Systematic Methodology to Compute the Architectural Vulnerability Factors for a High-Performance Microprocessor
Single-event upsets from particle strikes have become a key challenge in microprocessor design. Techniques to deal with these transient faults exist, but come at a cost. Designers...
Shubhendu S. Mukherjee, Christopher T. Weaver, Joe...
BMCBI
2010
123views more  BMCBI 2010»
14 years 10 months ago
Computationally efficient flux variability analysis
Background: Flux variability analysis is often used to determine robustness of metabolic models in various simulation conditions. However, its use has been somehow limited by the ...
Steinn Gudmundsson, Ines Thiele
CVPR
2004
IEEE
15 years 11 months ago
Optimizing Motion Estimation with Linear Programming and Detail-Preserving Variational Method
In this paper, we propose a novel linear programming based method to estimate arbitrary motion from two images. The proposed method always finds the global optimal solution of the...
Hao Jiang, Ze-Nian Li, Mark S. Drew
SPIN
2001
Springer
15 years 2 months ago
Addressing Dynamic Issues of Program Model Checking
Abstract. Model checking real programs has recently become an active research area. Programs however exhibit two characteristics that make model checking di cult: the complexity of...
Flavio Lerda, Willem Visser
GCC
2006
Springer
15 years 1 months ago
General Running Service: An Execution Framework for Executing Legacy Program on Grid
Legacy program execution system, which is necessary for Grid to enable users to reuse all legacy programs without reengineering source codes, is still an open problem. We propose ...
Likun Liu, Yongwei Wu, Guangwen Yang, Ruyue Ma, Fe...