A stream X-machine is a type of extended finite state machine with an associated development approach that consists of building a system from a set of trusted components. One of th...
Abstract--We adapt methods originally developed in information and coding theory to solve some testing problems. The efficiency of two-stage pool testing of items is characterized ...
We describe a method for implementing the evaluation and training of decision trees and forests entirely on a GPU, and show how this method can be used in the context of object rec...
Tree automata completion is a technique for the verification of infinite state systems. It has already been used for the verification of cryptographic protocols and the prototyping...
— This paper investigates the problem of the formation of an uplink tree structure among the IEEE 802.16j network’s relay stations (RSs) and their serving base station (MR-BS)....