Sciweavers

2899 search results - page 34 / 580
» Dynamic Trees in Practice
Sort
View
135
Voted
ATVA
2007
Springer
115views Hardware» more  ATVA 2007»
15 years 9 months ago
A Compositional Semantics for Dynamic Fault Trees in Terms of Interactive Markov Chains
Abstract. Dynamic fault trees (DFTs) are a versatile and common formalism to model and analyze the reliability of computer-based systems. This paper presents a formal semantics of ...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
118
Voted
ISPDC
2006
IEEE
15 years 9 months ago
How to Achieve High Throughput with Dynamic Tree-Structured Coterie
Data replication permits a better network bandwidth utilization and minimizes the effect of latency in large-scale systems such as computing grids. However, the cost of maintainin...
Ivan Frain, Abdelaziz Mzoughi, Jean Paul Bahsoun
IROS
2008
IEEE
165views Robotics» more  IROS 2008»
15 years 10 months ago
Probabilistic navigation in dynamic environment using Rapidly-exploring Random Trees and Gaussian processes
— The paper describes a navigation algorithm for dynamic, uncertain environment. Moving obstacles are supposed to move on typical patterns which are pre-learned and are represent...
Chiara Fulgenzi, Christopher Tay, Anne Spalanzani,...
138
Voted
ICALP
2009
Springer
16 years 3 months ago
Dynamic Succinct Ordered Trees
Abstract. We study the problem of maintaining a dynamic tree succinctly, in 2n + o(n) bits, under updates of the following form: insertion or deletion of a leaf, insertion of a nod...
Arash Farzan, J. Ian Munro
SCCC
2003
IEEE
15 years 8 months ago
Improved Deletions in Dynamic Spatial Approximation Trees
The Dynamic Spatial Approximation Tree (dsa–tree) is a recently proposed data structure for searching in metric spaces. It has been shown that it compares favorably against alte...
Gonzalo Navarro, Nora Reyes