Sciweavers

4095 search results - page 164 / 819
» How to test a tree
Sort
View
INFOCOM
2008
IEEE
14 years 5 months ago
BAKE: A Balanced Kautz Tree Structure for Peer-to-Peer Networks
Abstract—In order to improve scalability and reduce maintenance overhead for structured Peer-to-Peer systems, researchers design optimal architectures with constant degree and lo...
Deke Guo, Yunhao Liu, Xiang-Yang Li
DSN
2007
IEEE
14 years 5 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...
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 10 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel
ICCD
2006
IEEE
116views Hardware» more  ICCD 2006»
14 years 7 months ago
RTL Scan Design for Skewed-Load At-speed Test under Power Constraints
This paper discusses an automated method to build scan chains at the register-transfer level (RTL) for powerconstrained at-speed testing. By analyzing a circuit at the RTL, where ...
Ho Fai Ko, Nicola Nicolici
ICCD
2003
IEEE
145views Hardware» more  ICCD 2003»
14 years 7 months ago
Care Bit Density and Test Cube Clusters: Multi-Level Compression Opportunities
: Most of the recently discussed and commercially introduced test stimulus data compression techniques are based on low care bit densities found in typical scan test vectors. Data ...
Bernd Könemann