Sciweavers

16430 search results - page 395 / 3286
» On Computable Tree Functions
Sort
View
DSN
2007
IEEE
16 years 1 months ago
Dynamic Fault Tree Analysis Using Input/Output Interactive Markov Chains
Dynamic Fault Trees (DFT) extend standard fault trees by allowing the modeling of complex system components’ behaviors and interactions. Being a high level model and easy to use...
Hichem Boudali, Pepijn Crouzen, Mariëlle Stoe...
GD
1998
Springer
15 years 11 months ago
Balanced Aspect Ratio Trees and Their Use for Drawing Very Large Graphs
We describe a new approach for cluster-based drawing of very large graphs, which obtains clusters by using binary space partition (BSP) trees. We also introduce a novel BSP-type de...
Christian A. Duncan, Michael T. Goodrich, Stephen ...
DIS
2008
Springer
15 years 8 months ago
Empirical Asymmetric Selective Transfer in Multi-objective Decision Trees
We consider learning tasks where multiple target variables need to be predicted. Two approaches have been used in this setting: (a) build a separate single-target model for each ta...
Beau Piccart, Jan Struyf, Hendrik Blockeel
IWSEC
2010
Springer
15 years 5 months ago
Optimal Adversary Behavior for the Serial Model of Financial Attack Trees
Abstract. Attack tree analysis is used to estimate different parameters of general security threats based on information available for atomic subthreats. We focus on estimating the...
Margus Niitsoo
LICS
2010
IEEE
15 years 5 months ago
The Emptiness Problem for Tree Automata with Global Constraints
We define tree automata with global constraints (TAGC), generalizing the well-known class of tree automata with global equality and disequality constraints [14] (TAGED). TAGC can...
Luis Barguñó, Carles Creus, Guillem ...