replies to all probabilistic beliefs over the set. We present an algorithm that computes all minimal sCURB sets in any given … finite game. Runtime measurements on two-player games (where the concepts of CURB and sCURB coincide) show that the algorithm … is considerably faster than the earlier developed algorithm, that of Benisch et al. (2006). …

consistent prediction errors, and it helps to prevent data snooping. Tools are introduced to evaluate the algorithm, to see how … configurations are updated by the algorithm, to study how forecasting accuracy is affected by the choice of configurations, and to … find out which configurations can safely be ignored in order to increase the speed of the algorithm. In our case study we …

€™s chassis which are generally used in agriculture machines for the crops harvesting. Design of the fuzzy control algorithm was … focused to the wall following algorithm and obstacle avoidance. To achieve of the reliable results was made the real model of …

least manipulable envy-free rule can be obtained via agent-k-linked allocations. This note provides an algorithm for …

This communication reports the development of an algorithm for correction of specific gravity of biodiesels. The … specific gravity of cottonseed oil biodiesels (for example) was measured at different temperatures and the algorithm was … biodiesel. The obtained algorithm differs from that reported in EN 14214 and suggests that individual algorithms should be …

algorithm based on combined dispatch strategies, to achieve the optimal cost of battery incorporated hybrid energy system for …

: hardware area A and execution time E. An efficient heuristic algorithm with running time O(nlog⁡n) is proposed for the quality … approximate solutions of the problems with n code fragments. Also, an exact algorithm based on dynamic programming is presented to …

. Specifically, we investigate the appearance of maximum values of minors. The presented algorithm is tested for several values of j … and for Hadamard matrices of order 20. This algorithm is useful in the study of the growth factor for Hadamard matrices …

In 1991, we developed a floating random-walk algorithm to extract electrical capacitance in 2D structures. Since then … circuits (ICs) represented by multi-gigabyte databases. The algorithm has proven to be exceptionally powerful and is now … underlying the floating random-walk algorithm: a formulation of capacitance as an integral of infinite dimensionality evaluated …