Sciweavers

250 search results - page 27 / 50
» Verifying Tolerant Systems Using Polynomial Approximations
Sort
View
CORR
2007
Springer
84views Education» more  CORR 2007»
14 years 9 months ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
ICCAD
2003
IEEE
161views Hardware» more  ICCAD 2003»
15 years 6 months ago
A General S-Domain Hierarchical Network Reduction Algorithm
This paper presents an efficient method to reduce complexities of a linear network in s-domain. The new method works on circuit matrices directly and reduces the circuit complexi...
Sheldon X.-D. Tan
EUROGRAPHICS
2010
Eurographics
15 years 4 months ago
Interactive High-Quality Visualization of Higher-Order Finite Elements
Higher-order finite element methods have emerged as an important discretization scheme for simulation. They are increasingly used in contemporary numerical solvers, generating a ...
Markus Üffinger, Steffen Frey, Thomas Ertl
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
14 years 4 months ago
Event-triggered output feedback control of finite horizon discrete-time multi-dimensional linear processes
Event-triggered control systems are systems in which the control signal is recomputed when the plant's output signal leaves a triggering-set. There has been recent interest in...
Lichun Li, Michael Lemmon
OSDI
2008
ACM
15 years 9 months ago
FlightPath: Obedience vs. Choice in Cooperative Services
: We present FlightPath, a novel peer-to-peer streaming application that provides a highly reliable data stream to a dynamic set of peers. We demonstrate that FlightPath reduces ji...
Harry C. Li, Allen Clement, Mirco Marchetti, Manos...