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.
This paper explores the idea of integrating powerful optimization and planning techniques with knowledge representation formalisms of the Semantic Web. The paper outlines a language paradigm that combines algebraic and logical modelling of constraints and objective functions. It provides a method for instantiation of optimization and planning problems with Semantic Web background knowledge, by modelling...
In this paper, we study the problem of finding teams of experts from an expert network while optimizing three objectives. Given a project, the objective is to find teams of experts that cover all the required skills and also optimize the communication cost as well as the personnel cost and the expertise level of the team members. The expert network is modeled as a graph, where nodes represent experts...
In this paper there is introduced a solution for Intermediary Service Provider management based on network optimization and multi-agent technologies. Special attention is given to considering a combination of time factor and human factor in subject-oriented processes of decision making support.
A large amount of fragments of different ceramic objects are usually found during archaeological excavation. Finding the relation between these fragments is time-consuming and demands expert knowledge. In this paper, we study a related problem known as ceramic reconstruction. We present a novel content-based feature matching method and develop the ceramic fragment reassembly system (CFRS) for ceramic...
In this paper, we propose an item recommendation algorithm based on latent factors which uses implicit feedback from users to optimize the ranking of items according to individual preferences. The novelty of the algorithm is the integration of content metadata to improve the quality of recommendations. Such descriptions are an important source to construct a personalized set of items which are meaningfully...
This work addresses the coordination issue in distributed optimization problem (DOP) where multiple distinct and time-critical tasks are performed to satisfy a global objective function. The performance of these tasks has to be coordinated due to the sharing of consumable resources and the dependency on non-consumable resources. Knowing that it can be sub-optimal to predefine the performance of the...
Agent-oriented approaches highlight logistic concepts which give structure to large distributed systems. We present an innovative cooperative agent-based model for Crisis Management Supply Chain in order to solve a highly-distributed delivery scheduling problem. The Supply Chain studied in this work is complex and composed of several elements such as transport means, suppliers, areas in need, resources,...
This paper considers the task of answering shortest path queries in large real-world graphs such as social networks, communication networks and web graphs. The traditional Breadth First Search (BFS) approach for solving this problem is too time-consuming when networks with millions of nodes and possibly billions of edges are considered. A common technique to address these complexity issues uses a...
Evolutionary Algorithms (EAs), inspired by biological mechanisms observed in nature, such as selection and genetic changes, have much potential to find the best solution for a given optimisation problem. Contrary to Darwin, and according to Lamarck and Baldwin, organisms in natural systems learn to adapt over their lifetime and allow to adjust over generations. Whereas earlier research was rather...
We present a new decomposition algorithm for training bound-constrained Support Vector Machines in this paper. When selecting indices into the working set, only first order derivative information of the objective function in the optimization model is required. Therefore, the resulting working set selection strategy is simple and can be implemented easily. The new algorithm is proved to be global convergent...
People moving to a new place usually look for a suitable region with respect to their multiple criteria of interests. In this work we map this problem to the migration behavior of other species such as swarming, which is a collective behavior exhibited by animals of similar size which aggregate together, milling about the same region. Taking the swarm intelligence perspective, we present a novel method...
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.