Search results for " Computer Science"
showing 10 items of 3983 documents
Randomized heuristics for the Capacitated Clustering Problem
2017
In this paper, we investigate the adaptation of the Greedy Randomized Adaptive Search Procedure (GRASP) and Iterated Greedy methodologies to the Capacitated Clustering Problem (CCP). In particular, we focus on the effect of the balance between randomization and greediness on the performance of these multi-start heuristic search methods when solving this NP-hard problem. The former is a memory-less approach that constructs independent solutions, while the latter is a memory-based method that constructs linked solutions, obtained by partially rebuilding previous ones. Both are based on the combination of greediness and randomization in the constructive process, and coupled with a subsequent l…
A matheuristic for the Team Orienteering Arc Routing Problem
2015
In the Team OrienteeringArc Routing Problem (TOARP) the potential customers are located on the arcs of a directed graph and are to be chosen on the basis of an associated profit. A limited fleet of vehicles is available to serve the chosen customers. Each vehicle has to satisfy a maximum route duration constraint. The goal is to maximize the profit of the served customers. We propose a matheuristic for the TOARP and test it on a set of benchmark instances for which the optimal solution or an upper bound is known. The matheuristic finds the optimal solutions on all, except one, instances of one of the four classes of tested instances (with up to 27 vertices and 296 arcs). The average error o…
BMaD – A Boolean Matrix Decomposition Framework
2014
Boolean matrix decomposition is a method to obtain a compressed representation of a matrix with Boolean entries. We present a modular framework that unifies several Boolean matrix decomposition algorithms, and provide methods to evaluate their performance. The main advantages of the framework are its modular approach and hence the flexible combination of the steps of a Boolean matrix decomposition and the capability of handling missing values. The framework is licensed under the GPLv3 and can be downloaded freely at http://projects.informatik.uni-mainz.de/bmad.
A recurrence-free variant of strassen’s algorithm on hypercube
1995
In this paper a non-recursive Strassen’s matrix multiplication algorithm is presented. This new algorithm is suitable to run on parallel environments. Two computational schemes have been worked out exploiting different parallel approaches on hypercube architecture. A comparative analysis is reported. The experiments have been carried out on an nCUBE-2 supercomputer, housed at CNUCE in Pisa, supporting the Express parallel operating system. © 1995, Taylor & Francis Group, LLC. All rights reserved.
Classifying efficient alternatives in SMAA using cross confidence factors
2006
Abstract Stochastic multicriteria acceptability analysis (SMAA) is a family of methods for aiding multicriteria group decision making. These methods are based on exploring the weight space in order to describe the preferences that make each alternative the most preferred one. The main results of the analysis are rank acceptability indices, central weight vectors and confidence factors for different alternatives. The rank acceptability indices describe the variety of different preferences resulting in a certain rank for an alternative; the central weight vectors represent the typical preferences favouring each alternative; and the confidence factors measure whether the criteria data are suff…
A methodology for the reduction of imprecision in the engineering process
1997
Abstract Engineering design is characterized by a high level of imprecision, vague parameters, and ill-defined relationships. In design, imprecision reduction must occur to arrive at a final product specification. Few design systems exist for adequately representing design imprecision, and formally reducing it to precise values. Fuzzy set theory has considerable potential for addressing the imprecision in design. However, it lacks a formal methodology for system development and operation. One repercussion of this is that imprecision reduction is, at present, implemented in a relatively ad-hoc manner. The main contribution of this paper is to introduce a methodology called precision converge…
A Survey on how to Cross-Reference Web Information Sources
2015
International audience; The goal of giving information a well-defined meaning is currently shared by different research communities. Once information has a well-defined meaning, it can be searched and retrieved more effectively. Therefore, this paper is a survey about the methods that compare different textual information sources in order to determine whether they address a similar information or not. The improvement of the studied methods will eventually lead to increase the efficiency of documentary research. In order to achieve this goal, the first category of methods focuses on semantic measure definitions. A second category of methods focuses on paraphrase identification techniques, an…
Towards farm-level health management of offshore wind farms for maintenance improvements
2015
This paper studies a conceptual architecture for health management of offshore wind farms. To this aim, various necessary enablers of a health management sys- tem are presented to improve reliability and availability while optimizing maintenance costs. The main focus lies on improving existing condition monitoring systems based on concepts of condition-based maintenance and relia- bility centered maintenance. A brief review of the rel- evant state-of-the-art is presented and gaps to be filled towards realization of such health management system are discussed.
A Digital Watermarking Algorithm Based on DCT: Application on Medical Image
2012
International audience; This work is a presentation of a new approach of robust watermarking applied in medical domain such as telemedicine hence the need to keep the visual aspect of medical images and other conservation of the various data substituted. For hiding information, the proposed method uses the Discrete Cosine Transform (DCT) space. To control identification and eventually the correction (if possible) of the data inserted, it should be noted that we used the series turbocode to recover the data inserted and after application of several attacks.
A Watermarking of Medical Image : New Approach Based On "Multi-Layer" Method
2011
In order to contribute to security sharing and transmission of medical images, this paper propose a new approach for Watermarking image based on the techniques of Code Division Multiple Access (CDMA), Discrete Wavelet transform (DWT) and Error Correcting Code (ECC). The motivation of this approach is to improve the quantity of data integration with the conservation of the image visual quality. Therefore, this work permits to the user the capacity to correct the possible alterations if it exists. IRM and Echographic medical image are used to experiment this approach.