نتایج جستجو برای: fuzzy finite state machine
تعداد نتایج: 1374470 فیلتر نتایج به سال:
We present an analytical modeling of soccer football, and formulas to measure the average occurrence of plays per minute and the efficiency of a player in each playing position are proposed . Using data from the Spanish League on the occurrence of plays per player, we validate the proposed formulas. The correct sequence of moves is by means of the transition function of a finite automaton to so...
Plan recognition has been widely used in agents that need to infer which plans are being executed or which activities are being performed by others. In many applications, reasoning and acting in response to plan recognition requires time. In such systems, plan recognition is expected to be made not only with precision, but also in a timely fashion. When recognition cannot be made in time, an ag...
We describe a fast, high-performance name recognizer for Arabic texts. It combines a patternmatching engine and supporting data with a morphological analysis component. The role of the morphological analysis in accurate name recognition is discussed. VCe also provide evaluations of both morphological analysis and name recognition.
This paper describes IBM’s automatic reading tutor system, the Reading Companion. The reading tutor aims to improve the literacy skills of beginning readers, both children and adults, and help adults who are non-native speakers of English to learn the language. We describe Reading Companion’s architecture, which allows a large, globally distributed reading companion community to create and shar...
This document describes state machines for the General Internet Signaling Transport (GIST). The states of GIST nodes for a given flow and their transitions are presented in order to illustrate how GIST may be implemented.
We show how frequently occurring sequential patterns may be found from large datasets by first inducing a finite state automaton model describing the data, and then querying the model.
Syllables are elementary building blocks of bird song. In sounds of many songbirds a large class of syllables can be approximated as amplitude and frequency varying brief sinusoidal pulses. In this article we test how well bird species can be recognized by comparing simple sinusoidal representations of isolated syllables. Results are encouraging and show that with limited sets of bird species a...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید