نتایج جستجو برای: distributed learning automata
تعداد نتایج: 869844 فیلتر نتایج به سال:
Networks of timed automata can be used to specify and verify distributed embedded systems. This technical report provides timed automata templates for a few basic components of such systems as a first step towards a library of reusable components which shall facilitate the design and analysis of large distributed embedded systems. In particular timed automata templates for common input event st...
Inductive learning is the method of learning from observations. Inductive learning has important applications over a wide range of area including pattern recognition, language acquisition, bio-informatics and intelligent agent design. Because of such diverse applicability, inductive learning methods including automata learning, grammar induction, hidden markov model learning and symbolic statis...
We describe an algorithm for learning simple timed automata, known as real-time automata. The transitions of real-time automata can have a temporal constraint on the time of occurrence of the current symbol relative to the previous symbol. The learning algorithm is similar to the redblue fringe state-merging algorithm for the problem of learning deterministic finite automata. In addition to sta...
Different efforts have been done to address the problem of information overload on the Internet. Recommender systems aim at directing users through this information space, toward the resources that best meet their needs and interests by extracting knowledge from the previous users’ interactions. In this paper, we propose three algorithms to solve the web page recommendation problem. In our firs...
With the explosive growth in amount of information, it is highly required to utilize tools and methods in order to search, filter and manage resources. One of the major problems in text classification relates to the high dimensional feature spaces. Therefore, the main goal of text classification is to reduce the dimensionality of features space. There are many feature selection methods. However...
Recently, studying social networks plays a significant role in many applications of social network analysis, from the studying the characterization of network to that of financial applications. Due to the large data and privacy issues of social network services, there is only a limited local access to whole network data in a reasonable amount of time. Therefore, network sampling arises to study...
Dynamic reconfigurations are a powerful approach for the adaption of component-based or service-oriented software systems at runtime. Important issues in this area are the problems of state transfer and state consistency, i.e., to determine the system state after a reconfiguration and to ensure that it is valid. To deal with these problems, we introduce distributed port automata in this paper. ...
In distributed real-time systems, we cannot assume that clocks are perfectly synchronized. To model them, we borrow independent clocks from independent clocks timed automata (icTA). First, we define the timed universal and existential semantics icTA. The emptiness of universal timed language of an icTA, and the timed language inclusion of icTA are undecidable. To recover decidability, we propos...
نمودار تعداد نتایج جستجو در هر سال
با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید