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.
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...
How to make scientific and effective emergency decisions is a research hotspot in academic circles at present. This paper applies case-based reasoning to emergency aid decision-making, which provides a method of scientific and effective aid decision-making for the emergency leaders. The two-layer case retrieving algorithm based on structural similarity degree and attribute similarity degree is designed,...
The k-means method is a widely used clustering technique because of its simplicity and speed. However, the clustering result depends heavily on the chosen initial value. In this report, we propose a seeding method with independent component analysis for the k-means method. Using a benchmark dataset, we evaluate the performance of our proposed method and compare it with other seeding methods.
Auctions are well-studied mechanisms to solve decentralized resource allocation problems. In situations where complementarity exists among resources, combinatorial auctions may be utilized. Unfortunately, combinatorial auctions often incur hefty computational requirements, in that the underlying winner determination problem is known to be NP-hard. Although a number of efficient implementations are...
A natural requirement of a resource allocation system is to guarantee fairness to its participants. Fair allocation can be achieved either by distributed protocols known as cake-cutting algorithms or by centralized approaches, which first collect the agents' preferences and then decide on the allocation. Compared with cake-cutting algorithms, centralized approaches ageless restricted and can therefore...
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...
Nowadays, the research of software homology detection is more and more important in the flourishing software market. Most of the existing detection tools are based on text structure but ignore the syntax framework structure of program codes. A few tools based on syntax structure do not consider detection on semantics level, which can be avoided by some plagiarism. The comparison system put forward...
It is widely acknowledged that providing explanations is an important capability of intelligent systems. Explanation capabilities are useful, for example, in scenario-based training systems with intelligent virtual agents. Trainees learn more from scenario-based training when they understand why the virtual agents act the way they do. In this paper, we present a model for explainable BDI agents which...
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...
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.