A commonly used type of search tree is the alphabetic binary tree, which uses (without loss of generality) "less than" versus "greater than or equal to" tests ...
— This paper studies the problem of stability analysis for neural networks (NNs) with a time-varying delay. The activation functions are assumed to be neither monotonic, nor diff...
re more abstract than necessary. They depend on assumptions that are highly unlikely to occur in practical situations, which are often less formal and rigid. Nonetheless, we discus...
— Dual-failure scenarios are a real possibility in today’s optical networks and it is becoming more and more important for carriers and network operators to consider them when ...
This study compares five well-known association rule algorithms using three real-world datasets and an artificial dataset. The experimental results confirm the performance improve...