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.
In this paper, we describe the process by which web services ontologies are populated from a web services collection. The general approach relies on a global ontology model that is used to represent automatically web services. The model is enriched with web service instances classified into a taxonomy. The main idea is to extract taxonomic relations (isTypeOf) from web services using a supervised...
The purpose of this research is to minimize the length of an addition chain. Addition chains are employed to reduce the number of multiplications involved in modular exponentiation in public key cryptographic algorithms, such as RSA. Different heuristic methods have been used to optimize this length for a given exponent e. Among the main related works are: genetic algorithms (GA), evolutionary programming...
Researchers need to establish networks with colleagues that work similar topics, frequently, they are looking similar works by exploring free text in scientific publications in order to update them with the recent state of the art. They read the abstracts and decide whether or not it is a related and relevant work. Therefore, this paper presents an approach for linking researchers based on measuring...
Evolutionary algorithms have gained popularity as an alternative for dealing withmulti-objective optimization problems. However, these algorithms require to perform a relatively high number of fitness function evaluations in order to generate a reasonably good approximation of the Pareto front. This can be a shortcoming when fitness evaluations are computationally expensive. In this paper, we propose...
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.