936 resultados para Extremely random forest
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
XVIII IUFRO World Congress, Ljubljana 1986.
Resumo:
We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Theta(1) time units per histogram sample on a random geometric graph with noise-free links. The delay in computation is Theta(root n) time units. We further extend our approach to a network with noisy links. While the refresh rate remains Theta(1) time units per sample, the delay increases to Theta(root n log n). The number of transmissions in both cases is Theta(n) per histogram sample. The achieved Theta(1) refresh rate for PAC histogram computation is a significant improvement over the refresh rate of Theta(1/log n) for histogram computation in noiseless networks. We achieve this by operating in the supercritical thermodynamic regime where large pathways for communication build up, but the network may have more than one component. The largest component however will have an arbitrarily large fraction of nodes in order to enable approximate computation of the histogram to the desired level of accuracy. Operation in the supercritical thermodynamic regime also reduces energy consumption. A key step in the proof of our achievability result is the construction of a connected component having bounded degree and any desired fraction of nodes. This construction may also prove useful in other communication settings on the random geometric graph.
Resumo:
A new analytical model has been suggested for the hysteretic behaviour of beams. The model can be directly used in a response analysis without bothering to locate the precise point where the unloading commences. The model can efficiently simulate several types of realistic softening hysteretic loops. This is demonstrated by computing the response of cantilever beams under sinusoidal and random loadings. Results are presented in the form of graphs for maximum deflection, bending moment and shear