The Multi-model search framework generalizes minimax to allow exploitation of recursive opponent models. In this work we consider adding pruning to the multi-model search. We prove a sufficient condition that enables pruning and describe two pruning algorithms, αβ∗ and αβ∗ 1p. We prove correctness and optimality of the algorithms and provide an experimental study of their pruning power. We show...

This paper is a contribution to the discussion of the choices involved in implementing HPSG-based grammars and their consequences on the modularity and reusability of grammatical resources, a central issue in multi-lingual grammar development. Based on two examples from the English Resource Grammar (Flickinger et al., 2000), the treatment of unbounded dependencies and the analysis of optional a...

Abstract. The paper presents new method for sequential classification of the time series observations. Methods and algorithms of sequential recognition are obtained on the basis of the recursive equations for sufficient statistics. These recursive equations allow to construct algorithms of current classification of observable sequences in the rate of entering its values into the on-line operati...

An Algorithm to Model Paradigm Shifting in Fuzzy Clustering p. 70 ANFIS Synthesis by Hyperplane Clustering for Time Series Prediction p. 77 Generalized Splitting 2D Flexible Activation Function p. 85 Face Localization with Recursive Neural Networks p. 99 Multi-class Image Coding via EM-KLT Algorithm p. 106 A Face Detection System Based on Color and Support Vector Machines p. 113 A Neural Archit...

Current business trends, policy markets, production requirements, etc., have created the need for integrating Multi Agent Systems (MAS). In the agent-specialized literature, we have found very little work about MAS methodologies that allow us to build MAS which is made up of two or more MASs. We think that several difficult challenges for automated systems can be tackled by giving full meaning ...

In multi-state systems (MSS) reliability problems, it is assumed that the components of each subsystem have different performance rates with certain probabilities. This leads into extensive computational efforts involved in using the commonly employed universal generation function (UGF) and the recursive algorithm to obtain reliability of systems consisting of a large number of components. This...

In this paper, we construct the binary linear codes C(SL(n, q)) associated with finite special linear groups SL(n, q), with both n,q powers of two. Then, via Pless power moment identity and utilizing our previous result on the explicit expression of the Gauss sum for SL(n, q), we obtain a recursive formula for the power moments of multi-dimensional Kloosterman sums in terms of the frequencies o...

K-way hypergraph partitioning has an ever-growing use in parallelization of scientific computing applications. We claim that hypergraph partitioning with multiple constraints and fixed vertices should be implemented using direct K-way refinement, instead of the widely adopted recursive bisection paradigm. Our arguments are based on the fact that recursive-bisection-based partitioning algorithms...

Gaussian filtering is a basic operation commonly used in numerous image and volume processing algorithms. It is, therefore, desirable to perform it as efficiently as possible. Over the last decade CPUs have been successfully extended with several SIMD (Single Instruction Multiple Data) extensions, such as MMX, 3DNow!, and SSE series. In this paper we introduce a new technique for Gaussian filte...