Sciweavers

14403 search results - page 141 / 2881
» Dynamical Systems Trees
Sort
View
FOCS
1989
IEEE
15 years 8 months ago
Randomized Search Trees
We present a randomized strategy for maintaining balance in dynamically changing search trees that has optimal expected behavior. In particular, in the expected case a search or a...
Cecilia R. Aragon, Raimund Seidel
CORR
2011
Springer
169views Education» more  CORR 2011»
14 years 11 months ago
Upper Bounds for Maximally Greedy Binary Search Trees
At SODA 2009, Demaine et al. presented a novel connection between binary search trees (BSTs) and subsets of points on the plane. This connection was independently discovered by Der...
Kyle Fox
ORL
2000
62views more  ORL 2000»
15 years 4 months ago
Projected dynamical systems in a complementarity formalism
Projected dynamical systems have been introduced by Dupuis and Nagurney as dynamic extensions of variational inequalities. In the systems and control literature, complementarity s...
W. P. M. H. Heemels, J. M. Schumacher, Siep Weilan...
CORR
2010
Springer
80views Education» more  CORR 2010»
15 years 4 months ago
Fault Diagnosis with Dynamic Observers
In this paper, we review some recent results about the use of dynamic observers for fault diagnosis of discrete event systems. Dynamic observers can switch sensors on or off, thus ...
Franck Cassez, Stavros Tripakis
ENTCS
2007
143views more  ENTCS 2007»
15 years 4 months ago
Formal Fault Tree Analysis - Practical Experiences
Safety is an important requirement for many modern systems. To ensure safety of complex critical systems, well-known safety analysis methods have been formalized. This holds in pa...
Frank Ortmeier, Gerhard Schellhorn