Sciweavers

99 search results - page 14 / 20
» Stable normal forms for polynomial system solving
Sort
View
RTA
1995
Springer
13 years 11 months ago
Prototyping Completion with Constraints Using Computational Systems
We use computational systems to express a completion with constraints procedure that gives priority to simpliļ¬cations. Computational systems are rewrite theories enriched by stra...
Hélène Kirchner, Pierre-Etienne More...
TOMS
2011
101views more  TOMS 2011»
13 years 2 months ago
Partitioned Triangular Tridiagonalization
Abstract. We present a partitioned algorithm for reducing a symmetric matrix to a tridiagonal form, with partial pivoting. That is, the algorithm computes a factorization P AP T = ...
Miroslav Rozlozník, Gil Shklarski, Sivan To...
CDC
2010
IEEE
119views Control Systems» more  CDC 2010»
13 years 2 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
WG
2005
Springer
14 years 29 days ago
Hypertree Decompositions: Structure, Algorithms, and Applications
We review the concepts of hypertree decomposition and hypertree width from a graph theoretical perspective and report on a number of recent results related to these concepts. We al...
Georg Gottlob, Martin Grohe, Nysret Musliu, Marko ...
AAAI
2006
13 years 9 months ago
DNNF-based Belief State Estimation
As embedded systems grow increasingly complex, there is a pressing need for diagnosing and monitoring capabilities that estimate the system state robustly. This paper is based on ...
Paul Elliott, Brian C. Williams