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.
The schema matching problem consists of finding semantic correspondences between elements (e.g., attributes) of two database schemas. Typically, methods to solve this problem first use pair-wise functions called matchers to generate similarity scores values between pairs of elements from the two schemas. These scores are used as estimations of the correspondence between elements. Next, matchers are...
An adequate task allocation plan is an effective strategy to reduce collaboration issues in distributed software development. Practitioners adopt distinct processes to allocate tasks as well as diverse labels for the same activities and artifacts. This diversity is also found in literature. Task allocation proposals consider different elements and use distinct names for the same concepts. The lack...
Distributed Software Development (DSD) emerged from the need to achieve geographically distant customers and currently, allows organizations have global customers and other benefits. This scenario has given rise to new Software Engineering challenges resulting from DSD particularities. Several Systematic Reviews were conducted to address these new challenges. The objective of this paper is to categorize...
This paper presents an exact algorithm for the identical parallel machine scheduling problem over a formulation where each variable is indexed by a pair of jobs and a completion time. We show that such a formulation can be handled, in spite of its huge number of variables, through a branch cut and price algorithm enhanced by a number of practical techniques, including a dynamic programming procedure...
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.