The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
Time-critical dynamic decision making is a quite challenging task in many real-world applications. It requires to play a trade-off between solution optimality and computational tractability. It is especially true for multiagent settings under uncertainty. In this paper, we model time-critical dynamic decision problem using the representation of interactive dynamic influence diagram (I-DID). We formalize...
This article addresses the problem of coalition formation. Our work specially focuses on task oriented domains, where self-interested agents want to perform bundles of tasks. Depending on its resources, an agent may not be able to perform a bundle of tasks alone. Then the agent needs to find partners, interested in the same bundle, and agree to put their resources in common, in order to perform the...
Distributed Constraint Optimization Problem (DCOP) is a framework that recently emerged as one of the most successful approaches for coordination in Multi-Agent system. Dynamic Programming Optimization (DPOP) is an algorithm which requires only a linear number of messages, thus introducing exponentially less network overhead than other search algorithms when applied in a distributed setting. In DPOP...
This paper addresses visualized clustering methods that are embedded in CorMap and iView analysis of ideas towards the concerned topic. K-means clustering, automatic affinity diagram (KJ method) and self-organizing map are applied to CorMap analysis and graph clustering algorithm is applied to iView analysis are introduced. We report the visualized clustering results of workshops of a famous scientific...
Navigation of a student over learning objects can be solved by using concept space of a domain which contains information about structural and dependency relations between concepts. Every learning object has defined relations to several concepts. Relations which exist in the learning object space also exist in the concept space between the corresponding concepts. We present an evaluation of controlled...
We approach Information Retrieval (IR) from a User eXperience (UX) perspective. Through introducing a model for Information Retrieval eXperience (IRX), this paper operationalizes a perspective on IR that reaches beyond topicality. Based on a document's topicality, complexity, and emotional value, a model of relevance is proposed to influence user's IRX and, consequently, the synthesis and use of the...
This paper presents an agent-based model to compare different coordination patterns in joint fire support (JFS) scenarios. Modern war fighting approaches depend heavily on a separation of concerns (like reconnaissance, coordination and engagement) and therefore impose high requirements on the coordination of all involved parties. Following the General Reference Model for Agent-Based Modeling and Simulation...
This paper has the objective of presenting inteligent-agent methodology to evaluate the Air Traffic Flow Management (ATFM) scenario which aggregates the Dynamic Density criterion. The new evaluation function is proposed to determine the rewards in a reinforcement learning ATFM agent. The paper includes a specific analysis focused on the air scenario observed in Brazilian airspace. The comparative...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.