Sciweavers

250 search results - page 4 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
GRC
2007
IEEE
14 years 2 months ago
MGRS in Incomplete Information Systems
The original rough set model is concerned primarily with the approximation of sets described by single binary relation on the universe. In the view of granular computing, classica...
Yuhua Qian, Jiye Liang, Chuangyin Dang
ESOP
2010
Springer
14 years 5 months ago
Faulty Logic: Reasoning about Fault Tolerant Programs
Transient faults are single-shot hardware errors caused by high energy particles from space, manufacturing defects, overheating, and other sources. Such faults can be devastating f...
Matthew L. Meola and David Walker
JC
2002
50views more  JC 2002»
13 years 8 months ago
Verifying Topological Indices for Higher-Order Rank Deficiencies
It has been known how to use computational fixed point theorems to verify existence and uniqueness of a true solution to a nonlinear system of equations within a small region abou...
R. Baker Kearfott, Jianwei Dian
ICDCSW
2006
IEEE
14 years 2 months ago
Fault-Tolerance Verification of the Fluids and Combustion Facility of the International Space Station
The Fluids and Combustion Facility (FCF) will be a permanent modular, multi-user facility used to accommodate microgravity science experiments in the U.S. Laboratory Module onboar...
Raquel S. Whittlesey-Harris, Mikhail Nesterenko
VLSID
2005
IEEE
157views VLSI» more  VLSID 2005»
14 years 9 months ago
Energy Efficient Hardware Synthesis of Polynomial Expressions
Polynomial expressions are used to approximate a wide variety of functions commonly found in signal processing and computer graphics applications. Computing these polynomial expre...
Anup Hosangadi, Farzan Fallah, Ryan Kastner