Search Results - "Mongelli, H"

  • Showing 1 - 5 results of 5
Refine Results
  1. 1

    Performance results of running parallel applications on the InteGrade by Cáceres, E. N., Mongelli, H., Loureiro, L., Nishibe, C., Song, S. W.

    Published in Concurrency and computation (10-03-2010)
    “…The InteGrade middleware intends to exploit the idle time of computing resources in computer laboratories. In this work we investigate the performance of…”
    Get full text
    Journal Article
  2. 2

    A range minima parallel algorithm for coarse grained multicomputers by Mongelli, H., Song, S. W.

    Published in Lecture notes in computer science (28-10-2006)
    “…Given an array of n real numbers A=(a1, a2, ..., an), define MIN(i, j) = min {ai, ..., aj}. The range minima problem consists of preprocessing array A such…”
    Get full text
    Book Chapter Conference Proceeding
  3. 3

    A Survey on Solutions for Planted Motif Search Challenging Instances by AGUENA, D. S., MONGELLI, H., ALMEIDA, N. F.

    Published in Sistemas de Informação (Macaé) (01-12-2020)
    “…In the gene expression process, a transcription factor molecule will bind to a short substring in the promoter region of a gene in order to start the…”
    Get full text
    Journal Article
  4. 4

    Ant Colony System Based Solutions to the Quadratic Assignment Problem on GPGPU by C'ceres, E. N., Fingler, H., Mongelli, H., Song, S. W.

    “…The NP-hard Quadratic Assignment Problem (QAP) was proposed in 1957. Until this date, it remains one of the hardest problems to solve in any reasonable amount…”
    Get full text
    Conference Proceeding
  5. 5

    Experimental results of a coarse-grained parallel algorithm for spanning tree and connected components by Caceres, E N, Mongelli, H, Nishibe, C, Siang Wun Song

    “…Dehne et al. present a BSP/CGM algorithm for computing a spanning tree and the connected components of a graph, that requires O(log p) communication rounds,…”
    Get full text
    Conference Proceeding